MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  en2prd Structured version   Visualization version   GIF version

Theorem en2prd 9053
Description: Two proper unordered pairs are equinumerous. (Contributed by BTernaryTau, 23-Dec-2024.)
Hypotheses
Ref Expression
en2prd.1 (𝜑 → 𝐴 ∈ 𝑉)
en2prd.2 (𝜑 → 𝐵 ∈ 𝑊)
en2prd.3 (𝜑 → 𝐶 ∈ 𝑋)
en2prd.4 (𝜑 → 𝐷 ∈ 𝑌)
en2prd.5 (𝜑 → 𝐴 ≠ 𝐵)
en2prd.6 (𝜑 → 𝐶 ≠ 𝐷)
Assertion
Ref Expression
en2prd (𝜑 → {𝐴, 𝐵} ≈ {𝐶, 𝐷})

Proof of Theorem en2prd
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 prex 5395 . . 3 {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ∈ V
2 en2prd.5 . . . 4 (𝜑 → 𝐴 ≠ 𝐵)
3 en2prd.6 . . . 4 (𝜑 → 𝐶 ≠ 𝐷)
4 en2prd.1 . . . . 5 (𝜑 → 𝐴 ∈ 𝑉)
5 en2prd.3 . . . . 5 (𝜑 → 𝐶 ∈ 𝑋)
6 en2prd.2 . . . . 5 (𝜑 → 𝐵 ∈ 𝑊)
7 en2prd.4 . . . . 5 (𝜑 → 𝐷 ∈ 𝑌)
8 f1oprg 6859 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑋) ∧ (𝐵 ∈ 𝑊 ∧ 𝐷 ∈ 𝑌)) → ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐷) → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷}))
94, 5, 6, 7, 8syl22anc 852 . . . 4 (𝜑 → ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐷) → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷}))
102, 3, 9mp2and 712 . . 3 (𝜑 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷})
11 f1oeq1 6800 . . . 4 (𝑓 = {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} → (𝑓:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷} ↔ {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷}))
1211spcegv 3551 . . 3 ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ∈ V → ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷} → ∃𝑓 𝑓:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷}))
131, 10, 12mpsyl 69 . 2 (𝜑 → ∃𝑓 𝑓:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷})
14 prex 5395 . . 3 {𝐴, 𝐵} ∈ V
15 prex 5395 . . 3 {𝐶, 𝐷} ∈ V
16 breng 8960 . . 3 (({𝐴, 𝐵} ∈ V ∧ {𝐶, 𝐷} ∈ V) → ({𝐴, 𝐵} ≈ {𝐶, 𝐷} ↔ ∃𝑓 𝑓:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷}))
1714, 15, 16mp2an 705 . 2 ({𝐴, 𝐵} ≈ {𝐶, 𝐷} ↔ ∃𝑓 𝑓:{𝐴, 𝐵}–1-1-onto→{𝐶, 𝐷})
1813, 17sylibr 237 1 (𝜑 → {𝐴, 𝐵} ≈ {𝐶, 𝐷})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∃wex 1812   ∈ wcel 2145   ≠ wne 2955  Vcvv 3450  {cpr 4585  ⟨cop 4589   class class class wbr 5102  –1-1-onto→wf1o 6526   ≈ cen 8948
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-en 8952
This theorem is used by:  enpr2d  9054  rex2dom  9222
  Copyright terms: Public domain W3C validator