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

Theorem inf3lem1 9629
Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 9636 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
inf3lem1 (𝐴 ∈ ω → (𝐹‘𝐴) ⊆ (𝐹‘suc 𝐴))
Distinct variable group:   𝑥,𝑦,𝑤
Allowed substitution hints:   𝐴(𝑥, 𝑦, 𝑤)   𝐵(𝑥, 𝑦, 𝑤)   𝐹(𝑥, 𝑦, 𝑤)   𝐺(𝑥, 𝑦, 𝑤)

Proof of Theorem inf3lem1
Dummy variables 𝑣 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6885 . . 3 (𝑣 = ∅ → (𝐹‘𝑣) = (𝐹‘∅))
2 suceq 6431 . . . 4 (𝑣 = ∅ → suc 𝑣 = suc ∅)
32fveq2d 6889 . . 3 (𝑣 = ∅ → (𝐹‘suc 𝑣) = (𝐹‘suc ∅))
41, 3sseq12d 3941 . 2 (𝑣 = ∅ → ((𝐹‘𝑣) ⊆ (𝐹‘suc 𝑣) ↔ (𝐹‘∅) ⊆ (𝐹‘suc ∅)))
5 fveq2 6885 . . 3 (𝑣 = 𝑢 → (𝐹‘𝑣) = (𝐹‘𝑢))
6 suceq 6431 . . . 4 (𝑣 = 𝑢 → suc 𝑣 = suc 𝑢)
76fveq2d 6889 . . 3 (𝑣 = 𝑢 → (𝐹‘suc 𝑣) = (𝐹‘suc 𝑢))
85, 7sseq12d 3941 . 2 (𝑣 = 𝑢 → ((𝐹‘𝑣) ⊆ (𝐹‘suc 𝑣) ↔ (𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢)))
9 fveq2 6885 . . 3 (𝑣 = suc 𝑢 → (𝐹‘𝑣) = (𝐹‘suc 𝑢))
10 suceq 6431 . . . 4 (𝑣 = suc 𝑢 → suc 𝑣 = suc suc 𝑢)
1110fveq2d 6889 . . 3 (𝑣 = suc 𝑢 → (𝐹‘suc 𝑣) = (𝐹‘suc suc 𝑢))
129, 11sseq12d 3941 . 2 (𝑣 = suc 𝑢 → ((𝐹‘𝑣) ⊆ (𝐹‘suc 𝑣) ↔ (𝐹‘suc 𝑢) ⊆ (𝐹‘suc suc 𝑢)))
13 fveq2 6885 . . 3 (𝑣 = 𝐴 → (𝐹‘𝑣) = (𝐹‘𝐴))
14 suceq 6431 . . . 4 (𝑣 = 𝐴 → suc 𝑣 = suc 𝐴)
1514fveq2d 6889 . . 3 (𝑣 = 𝐴 → (𝐹‘suc 𝑣) = (𝐹‘suc 𝐴))
1613, 15sseq12d 3941 . 2 (𝑣 = 𝐴 → ((𝐹‘𝑣) ⊆ (𝐹‘suc 𝑣) ↔ (𝐹‘𝐴) ⊆ (𝐹‘suc 𝐴)))
17 inf3lem.1 . . . 4 𝐺 = (𝑦 ∈ V ↦ {𝑤 ∈ 𝑥 ∣ (𝑤 ∩ 𝑥) ⊆ 𝑦})
18 inf3lem.2 . . . 4 𝐹 = (rec(𝐺, ∅) ↾ ω)
19 inf3lem.3 . . . 4 𝐴 ∈ V
2017, 18, 19, 19inf3lemb 9626 . . 3 (𝐹‘∅) = ∅
21 0ss 4349 . . 3 ∅ ⊆ (𝐹‘suc ∅)
2220, 21eqsstri 3954 . 2 (𝐹‘∅) ⊆ (𝐹‘suc ∅)
23 sstr2 3915 . . . . . . . 8 ((𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢) → ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢)))
2423com12 33 . . . . . . 7 ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → ((𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢) → (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢)))
2524anim2d 624 . . . . . 6 ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → ((𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢)) → (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢))))
26 vex 3454 . . . . . . . . . 10 𝑢 ∈ V
2717, 18, 26, 19inf3lemc 9627 . . . . . . . . 9 (𝑢 ∈ ω → (𝐹‘suc 𝑢) = (𝐺‘(𝐹‘𝑢)))
2827eleq2d 2846 . . . . . . . 8 (𝑢 ∈ ω → (𝑣 ∈ (𝐹‘suc 𝑢) ↔ 𝑣 ∈ (𝐺‘(𝐹‘𝑢))))
29 vex 3454 . . . . . . . . 9 𝑣 ∈ V
30 fvex 6898 . . . . . . . . 9 (𝐹‘𝑢) ∈ V
3117, 18, 29, 30inf3lema 9625 . . . . . . . 8 (𝑣 ∈ (𝐺‘(𝐹‘𝑢)) ↔ (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢)))
3228, 31bitrdi 290 . . . . . . 7 (𝑢 ∈ ω → (𝑣 ∈ (𝐹‘suc 𝑢) ↔ (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢))))
33 peano2b 7894 . . . . . . . . . 10 (𝑢 ∈ ω ↔ suc 𝑢 ∈ ω)
3426sucex 7820 . . . . . . . . . . 11 suc 𝑢 ∈ V
3517, 18, 34, 19inf3lemc 9627 . . . . . . . . . 10 (suc 𝑢 ∈ ω → (𝐹‘suc suc 𝑢) = (𝐺‘(𝐹‘suc 𝑢)))
3633, 35sylbi 220 . . . . . . . . 9 (𝑢 ∈ ω → (𝐹‘suc suc 𝑢) = (𝐺‘(𝐹‘suc 𝑢)))
3736eleq2d 2846 . . . . . . . 8 (𝑢 ∈ ω → (𝑣 ∈ (𝐹‘suc suc 𝑢) ↔ 𝑣 ∈ (𝐺‘(𝐹‘suc 𝑢))))
38 fvex 6898 . . . . . . . . 9 (𝐹‘suc 𝑢) ∈ V
3917, 18, 29, 38inf3lema 9625 . . . . . . . 8 (𝑣 ∈ (𝐺‘(𝐹‘suc 𝑢)) ↔ (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢)))
4037, 39bitrdi 290 . . . . . . 7 (𝑢 ∈ ω → (𝑣 ∈ (𝐹‘suc suc 𝑢) ↔ (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢))))
4132, 40imbi12d 347 . . . . . 6 (𝑢 ∈ ω → ((𝑣 ∈ (𝐹‘suc 𝑢) → 𝑣 ∈ (𝐹‘suc suc 𝑢)) ↔ ((𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢)) → (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢)))))
4225, 41imbitrrid 249 . . . . 5 (𝑢 ∈ ω → ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → (𝑣 ∈ (𝐹‘suc 𝑢) → 𝑣 ∈ (𝐹‘suc suc 𝑢))))
4342imp 412 . . . 4 ((𝑢 ∈ ω ∧ (𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢)) → (𝑣 ∈ (𝐹‘suc 𝑢) → 𝑣 ∈ (𝐹‘suc suc 𝑢)))
4443ssrdv 3914 . . 3 ((𝑢 ∈ ω ∧ (𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢)) → (𝐹‘suc 𝑢) ⊆ (𝐹‘suc suc 𝑢))
4544ex 418 . 2 (𝑢 ∈ ω → ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → (𝐹‘suc 𝑢) ⊆ (𝐹‘suc suc 𝑢)))
464, 8, 12, 16, 22, 45finds 7908 1 (𝐴 ∈ ω → (𝐹‘𝐴) ⊆ (𝐹‘suc 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089  ∅c0 4278   ↦ cmpt 5185   ↾ cres 5652  suc csuc 6364  ‘cfv 6538  ωcom 7877  reccrdg 8417
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418
This theorem is used by:  inf3lem4  9632
  Copyright terms: Public domain W3C validator