Theorem pr2neOLD 10034

Description: Obsolete version of pr2ne 10033 as of 30-Dec-2024. (Contributed by FL, 14-Feb-2010.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
pr2neOLD	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} ≈ 2o ↔ 𝐴 ≠ 𝐵))

Proof of Theorem pr2neOLD

Step	Hyp	Ref	Expression
1		preq2 4741	. . . . 5 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴})
2	1	eqcoms 2735	. . . 4 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴, 𝐴})
3		enpr1g 9049	. . . . . . . 8 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐴} ≈ 1o)
4		entr 9031	. . . . . . . . . . . 12 ⊢ (({𝐴, 𝐵} ≈ {𝐴, 𝐴} ∧ {𝐴, 𝐴} ≈ 1o) → {𝐴, 𝐵} ≈ 1o)
5		1sdom2 9269	. . . . . . . . . . . . . . 15 ⊢ 1o ≺ 2o
6		sdomnen 9006	. . . . . . . . . . . . . . 15 ⊢ (1o ≺ 2o → ¬ 1o ≈ 2o)
7	5, 6	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ¬ 1o ≈ 2o
8		ensym 9028	. . . . . . . . . . . . . . 15 ⊢ ({𝐴, 𝐵} ≈ 1o → 1o ≈ {𝐴, 𝐵})
9		entr 9031	. . . . . . . . . . . . . . . 16 ⊢ ((1o ≈ {𝐴, 𝐵} ∧ {𝐴, 𝐵} ≈ 2o) → 1o ≈ 2o)
10	9	ex 411	. . . . . . . . . . . . . . 15 ⊢ (1o ≈ {𝐴, 𝐵} → ({𝐴, 𝐵} ≈ 2o → 1o ≈ 2o))
11	8, 10	syl 17	. . . . . . . . . . . . . 14 ⊢ ({𝐴, 𝐵} ≈ 1o → ({𝐴, 𝐵} ≈ 2o → 1o ≈ 2o))
12	7, 11	mtoi 198	. . . . . . . . . . . . 13 ⊢ ({𝐴, 𝐵} ≈ 1o → ¬ {𝐴, 𝐵} ≈ 2o)
13	12	a1d 25	. . . . . . . . . . . 12 ⊢ ({𝐴, 𝐵} ≈ 1o → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))
14	4, 13	syl 17	. . . . . . . . . . 11 ⊢ (({𝐴, 𝐵} ≈ {𝐴, 𝐴} ∧ {𝐴, 𝐴} ≈ 1o) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))
15	14	ex 411	. . . . . . . . . 10 ⊢ ({𝐴, 𝐵} ≈ {𝐴, 𝐴} → ({𝐴, 𝐴} ≈ 1o → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ¬ {𝐴, 𝐵} ≈ 2o)))
16		prex 5436	. . . . . . . . . . 11 ⊢ {𝐴, 𝐵} ∈ V
17		eqeng 9011	. . . . . . . . . . 11 ⊢ ({𝐴, 𝐵} ∈ V → ({𝐴, 𝐵} = {𝐴, 𝐴} → {𝐴, 𝐵} ≈ {𝐴, 𝐴}))
18	16, 17	ax-mp 5	. . . . . . . . . 10 ⊢ ({𝐴, 𝐵} = {𝐴, 𝐴} → {𝐴, 𝐵} ≈ {𝐴, 𝐴})
19	15, 18	syl11 33	. . . . . . . . 9 ⊢ ({𝐴, 𝐴} ≈ 1o → ({𝐴, 𝐵} = {𝐴, 𝐴} → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ¬ {𝐴, 𝐵} ≈ 2o)))
20	19	a1dd 50	. . . . . . . 8 ⊢ ({𝐴, 𝐴} ≈ 1o → ({𝐴, 𝐵} = {𝐴, 𝐴} → (𝐵 ∈ 𝐷 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))))
21	3, 20	syl 17	. . . . . . 7 ⊢ (𝐴 ∈ 𝐶 → ({𝐴, 𝐵} = {𝐴, 𝐴} → (𝐵 ∈ 𝐷 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))))
22	21	com23 86	. . . . . 6 ⊢ (𝐴 ∈ 𝐶 → (𝐵 ∈ 𝐷 → ({𝐴, 𝐵} = {𝐴, 𝐴} → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))))
23	22	imp 405	. . . . 5 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} = {𝐴, 𝐴} → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ¬ {𝐴, 𝐵} ≈ 2o)))
24	23	pm2.43a 54	. . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} = {𝐴, 𝐴} → ¬ {𝐴, 𝐵} ≈ 2o))
25	2, 24	syl5 34	. . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 = 𝐵 → ¬ {𝐴, 𝐵} ≈ 2o))
26	25	necon2ad 2951	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} ≈ 2o → 𝐴 ≠ 𝐵))
27		enpr2 10031	. . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ≈ 2o)
28	27	3expia 1118	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ≠ 𝐵 → {𝐴, 𝐵} ≈ 2o))
29	26, 28	impbid 211	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} ≈ 2o ↔ 𝐴 ≠ 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533   ∈ wcel 2098   ≠ wne 2936  Vcvv 3471  {cpr 4632   class class class wbr 5150  1_oc1o 8484  2_oc2o 8485   ≈ cen 8965   ≺ csdm 8967

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2698  ax-sep 5301  ax-nul 5308  ax-pow 5367  ax-pr 5431  ax-un 7744

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2937  df-ral 3058  df-rex 3067  df-rab 3429  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4325  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4911  df-br 5151  df-opab 5213  df-id 5578  df-xp 5686  df-rel 5687  df-cnv 5688  df-co 5689  df-dm 5690  df-rn 5691  df-res 5692  df-ima 5693  df-suc 6378  df-iota 6503  df-fun 6553  df-fn 6554  df-f 6555  df-f1 6556  df-fo 6557  df-f1o 6558  df-fv 6559  df-1o 8491  df-2o 8492  df-er 8729  df-en 8969  df-dom 8970  df-sdom 8971

This theorem is referenced by: (None)

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »