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

Theorem entrfil 9238
Description: Transitivity of equinumerosity for finite sets, proved without using the Axiom of Power Sets (unlike entr 9071). (Contributed by BTernaryTau, 10-Sep-2024.)
Assertion
Ref Expression
entrfil ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ≈ 𝐶) → 𝐴 ≈ 𝐶)

Proof of Theorem entrfil
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bren 9021 . 2 (𝐵 ≈ 𝐶 ↔ ∃𝑓 𝑓:𝐵⟶1-1onto𝐶)
2 bren 9021 . . 3 (𝐴 ≈ 𝐵 ↔ ∃𝑔 𝑔:𝐴⟶1-1onto𝐵)
3 exdistrv 1990 . . . . 5 (∃𝑔∃𝑓(𝑔:𝐴⟶1-1onto𝐵 ∧ 𝑓:𝐵⟶1-1onto𝐶) ↔ (∃𝑔 𝑔:𝐴⟶1-1onto𝐵 ∧ ∃𝑓 𝑓:𝐵⟶1-1onto𝐶))
4 19.42vv 1992 . . . . . 6 (∃𝑔∃𝑓(𝐴 ∈ Fin ∧ (𝑔:𝐴⟶1-1onto𝐵 ∧ 𝑓:𝐵⟶1-1onto𝐶)) ↔ (𝐴 ∈ Fin ∧ ∃𝑔∃𝑓(𝑔:𝐴⟶1-1onto𝐵 ∧ 𝑓:𝐵⟶1-1onto𝐶)))
5 f1oco 6878 . . . . . . . . 9 ((𝑓:𝐵⟶1-1onto𝐶 ∧ 𝑔:𝐴⟶1-1onto𝐵) → (𝑓 ∘ 𝑔):𝐴⟶1-1onto𝐶)
65ancoms 464 . . . . . . . 8 ((𝑔:𝐴⟶1-1onto𝐵 ∧ 𝑓:𝐵⟶1-1onto𝐶) → (𝑓 ∘ 𝑔):𝐴⟶1-1onto𝐶)
7 f1oenfi 9232 . . . . . . . 8 ((𝐴 ∈ Fin ∧ (𝑓 ∘ 𝑔):𝐴⟶1-1onto𝐶) → 𝐴 ≈ 𝐶)
86, 7sylan2 605 . . . . . . 7 ((𝐴 ∈ Fin ∧ (𝑔:𝐴⟶1-1onto𝐵 ∧ 𝑓:𝐵⟶1-1onto𝐶)) → 𝐴 ≈ 𝐶)
98exlimivv 1967 . . . . . 6 (∃𝑔∃𝑓(𝐴 ∈ Fin ∧ (𝑔:𝐴⟶1-1onto𝐵 ∧ 𝑓:𝐵⟶1-1onto𝐶)) → 𝐴 ≈ 𝐶)
104, 9sylbir 238 . . . . 5 ((𝐴 ∈ Fin ∧ ∃𝑔∃𝑓(𝑔:𝐴⟶1-1onto𝐵 ∧ 𝑓:𝐵⟶1-1onto𝐶)) → 𝐴 ≈ 𝐶)
113, 10sylan2br 607 . . . 4 ((𝐴 ∈ Fin ∧ (∃𝑔 𝑔:𝐴⟶1-1onto𝐵 ∧ ∃𝑓 𝑓:𝐵⟶1-1onto𝐶)) → 𝐴 ≈ 𝐶)
12113impb 1132 . . 3 ((𝐴 ∈ Fin ∧ ∃𝑔 𝑔:𝐴⟶1-1onto𝐵 ∧ ∃𝑓 𝑓:𝐵⟶1-1onto𝐶) → 𝐴 ≈ 𝐶)
132, 12syl3an2b 1432 . 2 ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐵 ∧ ∃𝑓 𝑓:𝐵⟶1-1onto𝐶) → 𝐴 ≈ 𝐶)
141, 13syl3an3b 1433 1 ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ≈ 𝐶) → 𝐴 ≈ 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∃wex 1812   ∈ wcel 2147   class class class wbr 5108   ∘ ccom 5662  ⟶1-1ontowf1o 6565   ≈ cen 9008  Fincfn 9011
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-om 7912  df-1o 8514  df-en 9012  df-fin 9015
This theorem is used by:  enfii  9239  entrfi  9243  phplem2  9258
  Copyright terms: Public domain W3C validator