ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  preleq GIF version

Theorem preleq 4572
Description: Equality of two unordered pairs when one member of each pair contains the other member. (Contributed by NM, 16-Oct-1996.)
Hypotheses
Ref Expression
preleq.1 𝐴 ∈ V
preleq.2 𝐵 ∈ V
preleq.3 𝐶 ∈ V
preleq.4 𝐷 ∈ V
Assertion
Ref Expression
preleq (((𝐴𝐵𝐶𝐷) ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → (𝐴 = 𝐶𝐵 = 𝐷))

Proof of Theorem preleq
StepHypRef Expression
1 en2lp 4571 . . . . 5 ¬ (𝐷𝐶𝐶𝐷)
2 eleq12 2254 . . . . . 6 ((𝐴 = 𝐷𝐵 = 𝐶) → (𝐴𝐵𝐷𝐶))
32anbi1d 465 . . . . 5 ((𝐴 = 𝐷𝐵 = 𝐶) → ((𝐴𝐵𝐶𝐷) ↔ (𝐷𝐶𝐶𝐷)))
41, 3mtbiri 676 . . . 4 ((𝐴 = 𝐷𝐵 = 𝐶) → ¬ (𝐴𝐵𝐶𝐷))
54con2i 628 . . 3 ((𝐴𝐵𝐶𝐷) → ¬ (𝐴 = 𝐷𝐵 = 𝐶))
65adantr 276 . 2 (((𝐴𝐵𝐶𝐷) ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → ¬ (𝐴 = 𝐷𝐵 = 𝐶))
7 preleq.1 . . . . 5 𝐴 ∈ V
8 preleq.2 . . . . 5 𝐵 ∈ V
9 preleq.3 . . . . 5 𝐶 ∈ V
10 preleq.4 . . . . 5 𝐷 ∈ V
117, 8, 9, 10preq12b 3785 . . . 4 ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶)))
1211biimpi 120 . . 3 ({𝐴, 𝐵} = {𝐶, 𝐷} → ((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶)))
1312adantl 277 . 2 (((𝐴𝐵𝐶𝐷) ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → ((𝐴 = 𝐶𝐵 = 𝐷) ∨ (𝐴 = 𝐷𝐵 = 𝐶)))
146, 13ecased 1360 1 (((𝐴𝐵𝐶𝐷) ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 709   = wceq 1364  wcel 2160  Vcvv 2752  {cpr 3608
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171  ax-setind 4554
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-v 2754  df-dif 3146  df-un 3148  df-sn 3613  df-pr 3614
This theorem is referenced by:  opthreg  4573
  Copyright terms: Public domain W3C validator