Theorem inf3lem5 9633

Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 9636 for detailed description. (Contributed by NM, 29-Oct-1996.)

Hypotheses

Ref	Expression
inf3lem.1	⊢ 𝐺 = (𝑦 ∈ V ↦ {𝑤 ∈ 𝑥 ∣ (𝑤 ∩ 𝑥) ⊆ 𝑦})
inf3lem.2	⊢ 𝐹 = (rec(𝐺, ∅) ↾ ω)
inf3lem.3	⊢ 𝐴 ∈ V
inf3lem.4	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
inf3lem5	⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))

Distinct variable group:   𝑥,𝑦,𝑤

Allowed substitution hints:   𝐴(𝑥, 𝑦, 𝑤)   𝐵(𝑥, 𝑦, 𝑤)   𝐹(𝑥, 𝑦, 𝑤)   𝐺(𝑥, 𝑦, 𝑤)

Proof of Theorem inf3lem5

Dummy variables 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnn 7888	. . . 4 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐴 ∈ ω) → 𝐵 ∈ ω)
2	1	ancoms 464	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ ω)
3		nnord 7885	. . . . . . 7 ⊢ (𝐴 ∈ ω → Ord 𝐴)
4		ordsucss 7829	. . . . . . 7 ⊢ (Ord 𝐴 → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴))
5	3, 4	syl 18	. . . . . 6 ⊢ (𝐴 ∈ ω → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴))
6	5	adantr 486	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴))
7		peano2b 7894	. . . . . 6 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω)
8		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑣 = suc 𝐵 → (𝐹‘𝑣) = (𝐹‘suc 𝐵))
9	8	psseq2d 4044	. . . . . . . . 9 ⊢ (𝑣 = suc 𝐵 → ((𝐹‘𝐵) ⊊ (𝐹‘𝑣) ↔ (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵)))
10	9	imbi2d 343	. . . . . . . 8 ⊢ (𝑣 = suc 𝐵 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑣)) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵))))
11		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑣 = 𝑢 → (𝐹‘𝑣) = (𝐹‘𝑢))
12	11	psseq2d 4044	. . . . . . . . 9 ⊢ (𝑣 = 𝑢 → ((𝐹‘𝐵) ⊊ (𝐹‘𝑣) ↔ (𝐹‘𝐵) ⊊ (𝐹‘𝑢)))
13	12	imbi2d 343	. . . . . . . 8 ⊢ (𝑣 = 𝑢 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑣)) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑢))))
14		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑣 = suc 𝑢 → (𝐹‘𝑣) = (𝐹‘suc 𝑢))
15	14	psseq2d 4044	. . . . . . . . 9 ⊢ (𝑣 = suc 𝑢 → ((𝐹‘𝐵) ⊊ (𝐹‘𝑣) ↔ (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢)))
16	15	imbi2d 343	. . . . . . . 8 ⊢ (𝑣 = suc 𝑢 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑣)) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))))
17		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑣 = 𝐴 → (𝐹‘𝑣) = (𝐹‘𝐴))
18	17	psseq2d 4044	. . . . . . . . 9 ⊢ (𝑣 = 𝐴 → ((𝐹‘𝐵) ⊊ (𝐹‘𝑣) ↔ (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))
19	18	imbi2d 343	. . . . . . . 8 ⊢ (𝑣 = 𝐴 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑣)) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
20		inf3lem.1	. . . . . . . . . . 11 ⊢ 𝐺 = (𝑦 ∈ V ↦ {𝑤 ∈ 𝑥 ∣ (𝑤 ∩ 𝑥) ⊆ 𝑦})
21		inf3lem.2	. . . . . . . . . . 11 ⊢ 𝐹 = (rec(𝐺, ∅) ↾ ω)
22		inf3lem.4	. . . . . . . . . . 11 ⊢ 𝐵 ∈ V
23	20, 21, 22, 22	inf3lem4 9632	. . . . . . . . . 10 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐵 ∈ ω → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵)))
24	23	com12 33	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵)))
25	7, 24	sylbir 238	. . . . . . . 8 ⊢ (suc 𝐵 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵)))
26		vex 3455	. . . . . . . . . . . 12 ⊢ 𝑢 ∈ V
27	20, 21, 26, 22	inf3lem4 9632	. . . . . . . . . . 11 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝑢 ∈ ω → (𝐹‘𝑢) ⊊ (𝐹‘suc 𝑢)))
28		psstr 4056	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝐵) ⊊ (𝐹‘𝑢) ∧ (𝐹‘𝑢) ⊊ (𝐹‘suc 𝑢)) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))
29	28	expcom 419	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑢) ⊊ (𝐹‘suc 𝑢) → ((𝐹‘𝐵) ⊊ (𝐹‘𝑢) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢)))
30	27, 29	syl6com 38	. . . . . . . . . 10 ⊢ (𝑢 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝐹‘𝐵) ⊊ (𝐹‘𝑢) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))))
31	30	a2d 30	. . . . . . . . 9 ⊢ (𝑢 ∈ ω → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑢)) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))))
32	31	ad2antrr 739	. . . . . . . 8 ⊢ (((𝑢 ∈ ω ∧ suc 𝐵 ∈ ω) ∧ suc 𝐵 ⊆ 𝑢) → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑢)) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))))
33	10, 13, 16, 19, 25, 32	findsg 7909	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ suc 𝐵 ∈ ω) ∧ suc 𝐵 ⊆ 𝐴) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))
34	33	ex 418	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ suc 𝐵 ∈ ω) → (suc 𝐵 ⊆ 𝐴 → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
35	7, 34	sylan2b 606	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐵 ⊆ 𝐴 → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
36	6, 35	syld 48	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ∈ 𝐴 → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
37	36	impancom 457	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → (𝐵 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
38	2, 37	mpd 16	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))
39	38	com12 33	1 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  {crab 3413  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899   ⊊ wpss 3900  ∅c0 4279  ∪ cuni 4867   ↦ cmpt 5186   ↾ cres 5653  Ord word 6361  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 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751  ax-reg 9586

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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:  inf3lem6  9634