Theorem inf3lem1 9581

Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 9588 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.

Step	Hyp	Ref	Expression
1		fveq2 6858	. . 3 ⊢ (𝑣 = ∅ → (𝐹‘𝑣) = (𝐹‘∅))
2		suceq 6400	. . . 4 ⊢ (𝑣 = ∅ → suc 𝑣 = suc ∅)
3	2	fveq2d 6862	. . 3 ⊢ (𝑣 = ∅ → (𝐹‘suc 𝑣) = (𝐹‘suc ∅))
4	1, 3	sseq12d 3980	. 2 ⊢ (𝑣 = ∅ → ((𝐹‘𝑣) ⊆ (𝐹‘suc 𝑣) ↔ (𝐹‘∅) ⊆ (𝐹‘suc ∅)))
5		fveq2 6858	. . 3 ⊢ (𝑣 = 𝑢 → (𝐹‘𝑣) = (𝐹‘𝑢))
6		suceq 6400	. . . 4 ⊢ (𝑣 = 𝑢 → suc 𝑣 = suc 𝑢)
7	6	fveq2d 6862	. . 3 ⊢ (𝑣 = 𝑢 → (𝐹‘suc 𝑣) = (𝐹‘suc 𝑢))
8	5, 7	sseq12d 3980	. 2 ⊢ (𝑣 = 𝑢 → ((𝐹‘𝑣) ⊆ (𝐹‘suc 𝑣) ↔ (𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢)))
9		fveq2 6858	. . 3 ⊢ (𝑣 = suc 𝑢 → (𝐹‘𝑣) = (𝐹‘suc 𝑢))
10		suceq 6400	. . . 4 ⊢ (𝑣 = suc 𝑢 → suc 𝑣 = suc suc 𝑢)
11	10	fveq2d 6862	. . 3 ⊢ (𝑣 = suc 𝑢 → (𝐹‘suc 𝑣) = (𝐹‘suc suc 𝑢))
12	9, 11	sseq12d 3980	. 2 ⊢ (𝑣 = suc 𝑢 → ((𝐹‘𝑣) ⊆ (𝐹‘suc 𝑣) ↔ (𝐹‘suc 𝑢) ⊆ (𝐹‘suc suc 𝑢)))
13		fveq2 6858	. . 3 ⊢ (𝑣 = 𝐴 → (𝐹‘𝑣) = (𝐹‘𝐴))
14		suceq 6400	. . . 4 ⊢ (𝑣 = 𝐴 → suc 𝑣 = suc 𝐴)
15	14	fveq2d 6862	. . 3 ⊢ (𝑣 = 𝐴 → (𝐹‘suc 𝑣) = (𝐹‘suc 𝐴))
16	13, 15	sseq12d 3980	. 2 ⊢ (𝑣 = 𝐴 → ((𝐹‘𝑣) ⊆ (𝐹‘suc 𝑣) ↔ (𝐹‘𝐴) ⊆ (𝐹‘suc 𝐴)))
17		inf3lem.1	. . . 4 ⊢ 𝐺 = (𝑦 ∈ V ↦ {𝑤 ∈ 𝑥 ∣ (𝑤 ∩ 𝑥) ⊆ 𝑦})
18		inf3lem.2	. . . 4 ⊢ 𝐹 = (rec(𝐺, ∅) ↾ ω)
19		inf3lem.3	. . . 4 ⊢ 𝐴 ∈ V
20	17, 18, 19, 19	inf3lemb 9578	. . 3 ⊢ (𝐹‘∅) = ∅
21		0ss 4363	. . 3 ⊢ ∅ ⊆ (𝐹‘suc ∅)
22	20, 21	eqsstri 3993	. 2 ⊢ (𝐹‘∅) ⊆ (𝐹‘suc ∅)
23		sstr2 3953	. . . . . . . 8 ⊢ ((𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢) → ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢)))
24	23	com12 32	. . . . . . 7 ⊢ ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → ((𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢) → (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢)))
25	24	anim2d 612	. . . . . 6 ⊢ ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → ((𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢)) → (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢))))
26		vex 3451	. . . . . . . . . 10 ⊢ 𝑢 ∈ V
27	17, 18, 26, 19	inf3lemc 9579	. . . . . . . . 9 ⊢ (𝑢 ∈ ω → (𝐹‘suc 𝑢) = (𝐺‘(𝐹‘𝑢)))
28	27	eleq2d 2814	. . . . . . . 8 ⊢ (𝑢 ∈ ω → (𝑣 ∈ (𝐹‘suc 𝑢) ↔ 𝑣 ∈ (𝐺‘(𝐹‘𝑢))))
29		vex 3451	. . . . . . . . 9 ⊢ 𝑣 ∈ V
30		fvex 6871	. . . . . . . . 9 ⊢ (𝐹‘𝑢) ∈ V
31	17, 18, 29, 30	inf3lema 9577	. . . . . . . 8 ⊢ (𝑣 ∈ (𝐺‘(𝐹‘𝑢)) ↔ (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢)))
32	28, 31	bitrdi 287	. . . . . . 7 ⊢ (𝑢 ∈ ω → (𝑣 ∈ (𝐹‘suc 𝑢) ↔ (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢))))
33		peano2b 7859	. . . . . . . . . 10 ⊢ (𝑢 ∈ ω ↔ suc 𝑢 ∈ ω)
34	26	sucex 7782	. . . . . . . . . . 11 ⊢ suc 𝑢 ∈ V
35	17, 18, 34, 19	inf3lemc 9579	. . . . . . . . . 10 ⊢ (suc 𝑢 ∈ ω → (𝐹‘suc suc 𝑢) = (𝐺‘(𝐹‘suc 𝑢)))
36	33, 35	sylbi 217	. . . . . . . . 9 ⊢ (𝑢 ∈ ω → (𝐹‘suc suc 𝑢) = (𝐺‘(𝐹‘suc 𝑢)))
37	36	eleq2d 2814	. . . . . . . 8 ⊢ (𝑢 ∈ ω → (𝑣 ∈ (𝐹‘suc suc 𝑢) ↔ 𝑣 ∈ (𝐺‘(𝐹‘suc 𝑢))))
38		fvex 6871	. . . . . . . . 9 ⊢ (𝐹‘suc 𝑢) ∈ V
39	17, 18, 29, 38	inf3lema 9577	. . . . . . . 8 ⊢ (𝑣 ∈ (𝐺‘(𝐹‘suc 𝑢)) ↔ (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢)))
40	37, 39	bitrdi 287	. . . . . . 7 ⊢ (𝑢 ∈ ω → (𝑣 ∈ (𝐹‘suc suc 𝑢) ↔ (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢))))
41	32, 40	imbi12d 344	. . . . . 6 ⊢ (𝑢 ∈ ω → ((𝑣 ∈ (𝐹‘suc 𝑢) → 𝑣 ∈ (𝐹‘suc suc 𝑢)) ↔ ((𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘𝑢)) → (𝑣 ∈ 𝑥 ∧ (𝑣 ∩ 𝑥) ⊆ (𝐹‘suc 𝑢)))))
42	25, 41	imbitrrid 246	. . . . 5 ⊢ (𝑢 ∈ ω → ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → (𝑣 ∈ (𝐹‘suc 𝑢) → 𝑣 ∈ (𝐹‘suc suc 𝑢))))
43	42	imp 406	. . . 4 ⊢ ((𝑢 ∈ ω ∧ (𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢)) → (𝑣 ∈ (𝐹‘suc 𝑢) → 𝑣 ∈ (𝐹‘suc suc 𝑢)))
44	43	ssrdv 3952	. . 3 ⊢ ((𝑢 ∈ ω ∧ (𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢)) → (𝐹‘suc 𝑢) ⊆ (𝐹‘suc suc 𝑢))
45	44	ex 412	. 2 ⊢ (𝑢 ∈ ω → ((𝐹‘𝑢) ⊆ (𝐹‘suc 𝑢) → (𝐹‘suc 𝑢) ⊆ (𝐹‘suc suc 𝑢)))
46	4, 8, 12, 16, 22, 45	finds 7872	1 ⊢ (𝐴 ∈ ω → (𝐹‘𝐴) ⊆ (𝐹‘suc 𝐴))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {crab 3405  Vcvv 3447   ∩ cin 3913   ⊆ wss 3914  ∅c0 4296   ↦ cmpt 5188   ↾ cres 5640  suc csuc 6334  ‘cfv 6511  ωcom 7842  reccrdg 8377

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378

This theorem is referenced by:  inf3lem4  9584