Theorem inf3lem5 8412

Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 8415 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 6967	. . . 4 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐴 ∈ ω) → 𝐵 ∈ ω)
2	1	ancoms 468	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ ω)
3		nnord 6965	. . . . . . 7 ⊢ (𝐴 ∈ ω → Ord 𝐴)
4		ordsucss 6910	. . . . . . 7 ⊢ (Ord 𝐴 → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴))
5	3, 4	syl 17	. . . . . 6 ⊢ (𝐴 ∈ ω → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴))
6	5	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴))
7		peano2b 6973	. . . . . 6 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω)
8		fveq2 6103	. . . . . . . . . 10 ⊢ (𝑣 = suc 𝐵 → (𝐹‘𝑣) = (𝐹‘suc 𝐵))
9	8	psseq2d 3662	. . . . . . . . 9 ⊢ (𝑣 = suc 𝐵 → ((𝐹‘𝐵) ⊊ (𝐹‘𝑣) ↔ (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵)))
10	9	imbi2d 329	. . . . . . . 8 ⊢ (𝑣 = suc 𝐵 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑣)) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵))))
11		fveq2 6103	. . . . . . . . . 10 ⊢ (𝑣 = 𝑢 → (𝐹‘𝑣) = (𝐹‘𝑢))
12	11	psseq2d 3662	. . . . . . . . 9 ⊢ (𝑣 = 𝑢 → ((𝐹‘𝐵) ⊊ (𝐹‘𝑣) ↔ (𝐹‘𝐵) ⊊ (𝐹‘𝑢)))
13	12	imbi2d 329	. . . . . . . 8 ⊢ (𝑣 = 𝑢 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑣)) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑢))))
14		fveq2 6103	. . . . . . . . . 10 ⊢ (𝑣 = suc 𝑢 → (𝐹‘𝑣) = (𝐹‘suc 𝑢))
15	14	psseq2d 3662	. . . . . . . . 9 ⊢ (𝑣 = suc 𝑢 → ((𝐹‘𝐵) ⊊ (𝐹‘𝑣) ↔ (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢)))
16	15	imbi2d 329	. . . . . . . 8 ⊢ (𝑣 = suc 𝑢 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑣)) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))))
17		fveq2 6103	. . . . . . . . . 10 ⊢ (𝑣 = 𝐴 → (𝐹‘𝑣) = (𝐹‘𝐴))
18	17	psseq2d 3662	. . . . . . . . 9 ⊢ (𝑣 = 𝐴 → ((𝐹‘𝐵) ⊊ (𝐹‘𝑣) ↔ (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))
19	18	imbi2d 329	. . . . . . . 8 ⊢ (𝑣 = 𝐴 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑣)) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
20		inf3lem.1	. . . . . . . . . . 11 ⊢ 𝐺 = (𝑦 ∈ V ↦ {𝑤 ∈ 𝑥 ∣ (𝑤 ∩ 𝑥) ⊆ 𝑦})
21		inf3lem.2	. . . . . . . . . . 11 ⊢ 𝐹 = (rec(𝐺, ∅) ↾ ω)
22		inf3lem.4	. . . . . . . . . . 11 ⊢ 𝐵 ∈ V
23	20, 21, 22, 22	inf3lem4 8411	. . . . . . . . . 10 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐵 ∈ ω → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵)))
24	23	com12 32	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵)))
25	7, 24	sylbir 224	. . . . . . . 8 ⊢ (suc 𝐵 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝐵)))
26		vex 3176	. . . . . . . . . . . 12 ⊢ 𝑢 ∈ V
27	20, 21, 26, 22	inf3lem4 8411	. . . . . . . . . . 11 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝑢 ∈ ω → (𝐹‘𝑢) ⊊ (𝐹‘suc 𝑢)))
28		psstr 3673	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝐵) ⊊ (𝐹‘𝑢) ∧ (𝐹‘𝑢) ⊊ (𝐹‘suc 𝑢)) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))
29	28	expcom 450	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑢) ⊊ (𝐹‘suc 𝑢) → ((𝐹‘𝐵) ⊊ (𝐹‘𝑢) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢)))
30	27, 29	syl6com 36	. . . . . . . . . 10 ⊢ (𝑢 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝐹‘𝐵) ⊊ (𝐹‘𝑢) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))))
31	30	a2d 29	. . . . . . . . 9 ⊢ (𝑢 ∈ ω → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑢)) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))))
32	31	ad2antrr 758	. . . . . . . 8 ⊢ (((𝑢 ∈ ω ∧ suc 𝐵 ∈ ω) ∧ suc 𝐵 ⊆ 𝑢) → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝑢)) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘suc 𝑢))))
33	10, 13, 16, 19, 25, 32	findsg 6985	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ suc 𝐵 ∈ ω) ∧ suc 𝐵 ⊆ 𝐴) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))
34	33	ex 449	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ suc 𝐵 ∈ ω) → (suc 𝐵 ⊆ 𝐴 → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
35	7, 34	sylan2b 491	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐵 ⊆ 𝐴 → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
36	6, 35	syld 46	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ∈ 𝐴 → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
37	36	impancom 455	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → (𝐵 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴))))
38	2, 37	mpd 15	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))
39	38	com12 32	1 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → (𝐹‘𝐵) ⊊ (𝐹‘𝐴)))

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  {crab 2900  Vcvv 3173   ∩ cin 3539   ⊆ wss 3540   ⊊ wpss 3541  ∅c0 3874  ∪ cuni 4372   ↦ cmpt 4643   ↾ cres 5040  Ord word 5639  suc csuc 5642  ‘cfv 5804  ωcom 6957  reccrdg 7392

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-reg 8380

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-om 6958  df-wrecs 7294  df-recs 7355  df-rdg 7393

This theorem is referenced by:  inf3lem6  8413