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

Theorem inf3lemd 8468
 Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 8476 for detailed description. (Contributed by NM, 28-Oct-1996.)
Hypotheses
Ref Expression
inf3lem.1 𝐺 = (𝑦 ∈ V ↦ {𝑤𝑥 ∣ (𝑤𝑥) ⊆ 𝑦})
inf3lem.2 𝐹 = (rec(𝐺, ∅) ↾ ω)
inf3lem.3 𝐴 ∈ V
inf3lem.4 𝐵 ∈ V
Assertion
Ref Expression
inf3lemd (𝐴 ∈ ω → (𝐹𝐴) ⊆ 𝑥)
Distinct variable group:   𝑥,𝑦,𝑤
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑤)   𝐵(𝑥,𝑦,𝑤)   𝐹(𝑥,𝑦,𝑤)   𝐺(𝑥,𝑦,𝑤)

Proof of Theorem inf3lemd
Dummy variables 𝑣 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6148 . . . . 5 (𝐴 = ∅ → (𝐹𝐴) = (𝐹‘∅))
2 inf3lem.1 . . . . . 6 𝐺 = (𝑦 ∈ V ↦ {𝑤𝑥 ∣ (𝑤𝑥) ⊆ 𝑦})
3 inf3lem.2 . . . . . 6 𝐹 = (rec(𝐺, ∅) ↾ ω)
4 inf3lem.3 . . . . . 6 𝐴 ∈ V
5 inf3lem.4 . . . . . 6 𝐵 ∈ V
62, 3, 4, 5inf3lemb 8466 . . . . 5 (𝐹‘∅) = ∅
71, 6syl6eq 2671 . . . 4 (𝐴 = ∅ → (𝐹𝐴) = ∅)
8 0ss 3944 . . . 4 ∅ ⊆ 𝑥
97, 8syl6eqss 3634 . . 3 (𝐴 = ∅ → (𝐹𝐴) ⊆ 𝑥)
109a1d 25 . 2 (𝐴 = ∅ → (𝐴 ∈ ω → (𝐹𝐴) ⊆ 𝑥))
11 nnsuc 7029 . . . 4 ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑣 ∈ ω 𝐴 = suc 𝑣)
12 vex 3189 . . . . . . . . . 10 𝑣 ∈ V
132, 3, 12, 5inf3lemc 8467 . . . . . . . . 9 (𝑣 ∈ ω → (𝐹‘suc 𝑣) = (𝐺‘(𝐹𝑣)))
1413eleq2d 2684 . . . . . . . 8 (𝑣 ∈ ω → (𝑢 ∈ (𝐹‘suc 𝑣) ↔ 𝑢 ∈ (𝐺‘(𝐹𝑣))))
15 vex 3189 . . . . . . . . . 10 𝑢 ∈ V
16 fvex 6158 . . . . . . . . . 10 (𝐹𝑣) ∈ V
172, 3, 15, 16inf3lema 8465 . . . . . . . . 9 (𝑢 ∈ (𝐺‘(𝐹𝑣)) ↔ (𝑢𝑥 ∧ (𝑢𝑥) ⊆ (𝐹𝑣)))
1817simplbi 476 . . . . . . . 8 (𝑢 ∈ (𝐺‘(𝐹𝑣)) → 𝑢𝑥)
1914, 18syl6bi 243 . . . . . . 7 (𝑣 ∈ ω → (𝑢 ∈ (𝐹‘suc 𝑣) → 𝑢𝑥))
2019ssrdv 3589 . . . . . 6 (𝑣 ∈ ω → (𝐹‘suc 𝑣) ⊆ 𝑥)
21 fveq2 6148 . . . . . . 7 (𝐴 = suc 𝑣 → (𝐹𝐴) = (𝐹‘suc 𝑣))
2221sseq1d 3611 . . . . . 6 (𝐴 = suc 𝑣 → ((𝐹𝐴) ⊆ 𝑥 ↔ (𝐹‘suc 𝑣) ⊆ 𝑥))
2320, 22syl5ibrcom 237 . . . . 5 (𝑣 ∈ ω → (𝐴 = suc 𝑣 → (𝐹𝐴) ⊆ 𝑥))
2423rexlimiv 3020 . . . 4 (∃𝑣 ∈ ω 𝐴 = suc 𝑣 → (𝐹𝐴) ⊆ 𝑥)
2511, 24syl 17 . . 3 ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → (𝐹𝐴) ⊆ 𝑥)
2625expcom 451 . 2 (𝐴 ≠ ∅ → (𝐴 ∈ ω → (𝐹𝐴) ⊆ 𝑥))
2710, 26pm2.61ine 2873 1 (𝐴 ∈ ω → (𝐹𝐴) ⊆ 𝑥)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   = wceq 1480   ∈ wcel 1987   ≠ wne 2790  ∃wrex 2908  {crab 2911  Vcvv 3186   ∩ cin 3554   ⊆ wss 3555  ∅c0 3891   ↦ cmpt 4673   ↾ cres 5076  suc csuc 5684  ‘cfv 5847  ωcom 7012  reccrdg 7450 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-tr 4713  df-eprel 4985  df-id 4989  df-po 4995  df-so 4996  df-fr 5033  df-we 5035  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-om 7013  df-wrecs 7352  df-recs 7413  df-rdg 7451 This theorem is referenced by:  inf3lem2  8470  inf3lem3  8471  inf3lem6  8474
 Copyright terms: Public domain W3C validator