Theorem inf3lem2 9094

Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 9100 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
inf3lem2	⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐴 ∈ ω → (𝐹‘𝐴) ≠ 𝑥))

Distinct variable group:   𝑥,𝑦,𝑤

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

Proof of Theorem inf3lem2

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

Step	Hyp	Ref	Expression
1		fveq2 6672	. . . . 5 ⊢ (𝑣 = ∅ → (𝐹‘𝑣) = (𝐹‘∅))
2	1	neeq1d 3077	. . . 4 ⊢ (𝑣 = ∅ → ((𝐹‘𝑣) ≠ 𝑥 ↔ (𝐹‘∅) ≠ 𝑥))
3	2	imbi2d 343	. . 3 ⊢ (𝑣 = ∅ → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝑣) ≠ 𝑥) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘∅) ≠ 𝑥)))
4		fveq2 6672	. . . . 5 ⊢ (𝑣 = 𝑢 → (𝐹‘𝑣) = (𝐹‘𝑢))
5	4	neeq1d 3077	. . . 4 ⊢ (𝑣 = 𝑢 → ((𝐹‘𝑣) ≠ 𝑥 ↔ (𝐹‘𝑢) ≠ 𝑥))
6	5	imbi2d 343	. . 3 ⊢ (𝑣 = 𝑢 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝑣) ≠ 𝑥) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝑢) ≠ 𝑥)))
7		fveq2 6672	. . . . 5 ⊢ (𝑣 = suc 𝑢 → (𝐹‘𝑣) = (𝐹‘suc 𝑢))
8	7	neeq1d 3077	. . . 4 ⊢ (𝑣 = suc 𝑢 → ((𝐹‘𝑣) ≠ 𝑥 ↔ (𝐹‘suc 𝑢) ≠ 𝑥))
9	8	imbi2d 343	. . 3 ⊢ (𝑣 = suc 𝑢 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝑣) ≠ 𝑥) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘suc 𝑢) ≠ 𝑥)))
10		fveq2 6672	. . . . 5 ⊢ (𝑣 = 𝐴 → (𝐹‘𝑣) = (𝐹‘𝐴))
11	10	neeq1d 3077	. . . 4 ⊢ (𝑣 = 𝐴 → ((𝐹‘𝑣) ≠ 𝑥 ↔ (𝐹‘𝐴) ≠ 𝑥))
12	11	imbi2d 343	. . 3 ⊢ (𝑣 = 𝐴 → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝑣) ≠ 𝑥) ↔ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐴) ≠ 𝑥)))
13		inf3lem.1	. . . . . . . 8 ⊢ 𝐺 = (𝑦 ∈ V ↦ {𝑤 ∈ 𝑥 ∣ (𝑤 ∩ 𝑥) ⊆ 𝑦})
14		inf3lem.2	. . . . . . . 8 ⊢ 𝐹 = (rec(𝐺, ∅) ↾ ω)
15		inf3lem.3	. . . . . . . 8 ⊢ 𝐴 ∈ V
16		inf3lem.4	. . . . . . . 8 ⊢ 𝐵 ∈ V
17	13, 14, 15, 16	inf3lemb 9090	. . . . . . 7 ⊢ (𝐹‘∅) = ∅
18	17	eqeq1i 2828	. . . . . 6 ⊢ ((𝐹‘∅) = 𝑥 ↔ ∅ = 𝑥)
19		eqcom 2830	. . . . . 6 ⊢ (∅ = 𝑥 ↔ 𝑥 = ∅)
20	18, 19	sylbb 221	. . . . 5 ⊢ ((𝐹‘∅) = 𝑥 → 𝑥 = ∅)
21	20	necon3i 3050	. . . 4 ⊢ (𝑥 ≠ ∅ → (𝐹‘∅) ≠ 𝑥)
22	21	adantr 483	. . 3 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘∅) ≠ 𝑥)
23		vex 3499	. . . . . . . . 9 ⊢ 𝑢 ∈ V
24	13, 14, 23, 16	inf3lemd 9092	. . . . . . . 8 ⊢ (𝑢 ∈ ω → (𝐹‘𝑢) ⊆ 𝑥)
25		df-pss 3956	. . . . . . . . . 10 ⊢ ((𝐹‘𝑢) ⊊ 𝑥 ↔ ((𝐹‘𝑢) ⊆ 𝑥 ∧ (𝐹‘𝑢) ≠ 𝑥))
26		pssnel 4422	. . . . . . . . . 10 ⊢ ((𝐹‘𝑢) ⊊ 𝑥 → ∃𝑣(𝑣 ∈ 𝑥 ∧ ¬ 𝑣 ∈ (𝐹‘𝑢)))
27	25, 26	sylbir 237	. . . . . . . . 9 ⊢ (((𝐹‘𝑢) ⊆ 𝑥 ∧ (𝐹‘𝑢) ≠ 𝑥) → ∃𝑣(𝑣 ∈ 𝑥 ∧ ¬ 𝑣 ∈ (𝐹‘𝑢)))
28		ssel 3963	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ⊆ ∪ 𝑥 → (𝑣 ∈ 𝑥 → 𝑣 ∈ ∪ 𝑥))
29		eluni 4843	. . . . . . . . . . . . . . 15 ⊢ (𝑣 ∈ ∪ 𝑥 ↔ ∃𝑓(𝑣 ∈ 𝑓 ∧ 𝑓 ∈ 𝑥))
30	28, 29	syl6ib 253	. . . . . . . . . . . . . 14 ⊢ (𝑥 ⊆ ∪ 𝑥 → (𝑣 ∈ 𝑥 → ∃𝑓(𝑣 ∈ 𝑓 ∧ 𝑓 ∈ 𝑥)))
31		eleq2 2903	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹‘suc 𝑢) = 𝑥 → (𝑓 ∈ (𝐹‘suc 𝑢) ↔ 𝑓 ∈ 𝑥))
32	31	biimparc 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑓 ∈ 𝑥 ∧ (𝐹‘suc 𝑢) = 𝑥) → 𝑓 ∈ (𝐹‘suc 𝑢))
33	13, 14, 23, 16	inf3lemc 9091	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑢 ∈ ω → (𝐹‘suc 𝑢) = (𝐺‘(𝐹‘𝑢)))
34	33	eleq2d 2900	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑢 ∈ ω → (𝑓 ∈ (𝐹‘suc 𝑢) ↔ 𝑓 ∈ (𝐺‘(𝐹‘𝑢))))
35		elin 4171	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑣 ∈ (𝑓 ∩ 𝑥) ↔ (𝑣 ∈ 𝑓 ∧ 𝑣 ∈ 𝑥))
36		vex 3499	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 𝑓 ∈ V
37		fvex 6685	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐹‘𝑢) ∈ V
38	13, 14, 36, 37	inf3lema 9089	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑓 ∈ (𝐺‘(𝐹‘𝑢)) ↔ (𝑓 ∈ 𝑥 ∧ (𝑓 ∩ 𝑥) ⊆ (𝐹‘𝑢)))
39	38	simprbi 499	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑓 ∈ (𝐺‘(𝐹‘𝑢)) → (𝑓 ∩ 𝑥) ⊆ (𝐹‘𝑢))
40	39	sseld 3968	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑓 ∈ (𝐺‘(𝐹‘𝑢)) → (𝑣 ∈ (𝑓 ∩ 𝑥) → 𝑣 ∈ (𝐹‘𝑢)))
41	35, 40	syl5bir 245	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑓 ∈ (𝐺‘(𝐹‘𝑢)) → ((𝑣 ∈ 𝑓 ∧ 𝑣 ∈ 𝑥) → 𝑣 ∈ (𝐹‘𝑢)))
42	34, 41	syl6bi 255	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑢 ∈ ω → (𝑓 ∈ (𝐹‘suc 𝑢) → ((𝑣 ∈ 𝑓 ∧ 𝑣 ∈ 𝑥) → 𝑣 ∈ (𝐹‘𝑢))))
43	32, 42	syl5 34	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ ω → ((𝑓 ∈ 𝑥 ∧ (𝐹‘suc 𝑢) = 𝑥) → ((𝑣 ∈ 𝑓 ∧ 𝑣 ∈ 𝑥) → 𝑣 ∈ (𝐹‘𝑢))))
44	43	com23 86	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑢 ∈ ω → ((𝑣 ∈ 𝑓 ∧ 𝑣 ∈ 𝑥) → ((𝑓 ∈ 𝑥 ∧ (𝐹‘suc 𝑢) = 𝑥) → 𝑣 ∈ (𝐹‘𝑢))))
45	44	exp5c 447	. . . . . . . . . . . . . . . . 17 ⊢ (𝑢 ∈ ω → (𝑣 ∈ 𝑓 → (𝑣 ∈ 𝑥 → (𝑓 ∈ 𝑥 → ((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢))))))
46	45	com34 91	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ ω → (𝑣 ∈ 𝑓 → (𝑓 ∈ 𝑥 → (𝑣 ∈ 𝑥 → ((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢))))))
47	46	impd 413	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ ω → ((𝑣 ∈ 𝑓 ∧ 𝑓 ∈ 𝑥) → (𝑣 ∈ 𝑥 → ((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢)))))
48	47	exlimdv 1934	. . . . . . . . . . . . . 14 ⊢ (𝑢 ∈ ω → (∃𝑓(𝑣 ∈ 𝑓 ∧ 𝑓 ∈ 𝑥) → (𝑣 ∈ 𝑥 → ((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢)))))
49	30, 48	sylan9r 511	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∈ ω ∧ 𝑥 ⊆ ∪ 𝑥) → (𝑣 ∈ 𝑥 → (𝑣 ∈ 𝑥 → ((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢)))))
50	49	pm2.43d 53	. . . . . . . . . . . 12 ⊢ ((𝑢 ∈ ω ∧ 𝑥 ⊆ ∪ 𝑥) → (𝑣 ∈ 𝑥 → ((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢))))
51		id 22	. . . . . . . . . . . . 13 ⊢ (((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢)) → ((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢)))
52	51	necon3bd 3032	. . . . . . . . . . . 12 ⊢ (((𝐹‘suc 𝑢) = 𝑥 → 𝑣 ∈ (𝐹‘𝑢)) → (¬ 𝑣 ∈ (𝐹‘𝑢) → (𝐹‘suc 𝑢) ≠ 𝑥))
53	50, 52	syl6 35	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ ω ∧ 𝑥 ⊆ ∪ 𝑥) → (𝑣 ∈ 𝑥 → (¬ 𝑣 ∈ (𝐹‘𝑢) → (𝐹‘suc 𝑢) ≠ 𝑥)))
54	53	impd 413	. . . . . . . . . 10 ⊢ ((𝑢 ∈ ω ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝑣 ∈ 𝑥 ∧ ¬ 𝑣 ∈ (𝐹‘𝑢)) → (𝐹‘suc 𝑢) ≠ 𝑥))
55	54	exlimdv 1934	. . . . . . . . 9 ⊢ ((𝑢 ∈ ω ∧ 𝑥 ⊆ ∪ 𝑥) → (∃𝑣(𝑣 ∈ 𝑥 ∧ ¬ 𝑣 ∈ (𝐹‘𝑢)) → (𝐹‘suc 𝑢) ≠ 𝑥))
56	27, 55	syl5 34	. . . . . . . 8 ⊢ ((𝑢 ∈ ω ∧ 𝑥 ⊆ ∪ 𝑥) → (((𝐹‘𝑢) ⊆ 𝑥 ∧ (𝐹‘𝑢) ≠ 𝑥) → (𝐹‘suc 𝑢) ≠ 𝑥))
57	24, 56	sylani 605	. . . . . . 7 ⊢ ((𝑢 ∈ ω ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝑢 ∈ ω ∧ (𝐹‘𝑢) ≠ 𝑥) → (𝐹‘suc 𝑢) ≠ 𝑥))
58	57	exp4b 433	. . . . . 6 ⊢ (𝑢 ∈ ω → (𝑥 ⊆ ∪ 𝑥 → (𝑢 ∈ ω → ((𝐹‘𝑢) ≠ 𝑥 → (𝐹‘suc 𝑢) ≠ 𝑥))))
59	58	pm2.43a 54	. . . . 5 ⊢ (𝑢 ∈ ω → (𝑥 ⊆ ∪ 𝑥 → ((𝐹‘𝑢) ≠ 𝑥 → (𝐹‘suc 𝑢) ≠ 𝑥)))
60	59	adantld 493	. . . 4 ⊢ (𝑢 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝐹‘𝑢) ≠ 𝑥 → (𝐹‘suc 𝑢) ≠ 𝑥)))
61	60	a2d 29	. . 3 ⊢ (𝑢 ∈ ω → (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝑢) ≠ 𝑥) → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘suc 𝑢) ≠ 𝑥)))
62	3, 6, 9, 12, 22, 61	finds 7610	. 2 ⊢ (𝐴 ∈ ω → ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹‘𝐴) ≠ 𝑥))
63	62	com12 32	1 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐴 ∈ ω → (𝐹‘𝐴) ≠ 𝑥))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   = wceq 1537  ∃wex 1780   ∈ wcel 2114   ≠ wne 3018  {crab 3144  Vcvv 3496   ∩ cin 3937   ⊆ wss 3938   ⊊ wpss 3939  ∅c0 4293  ∪ cuni 4840   ↦ cmpt 5148   ↾ cres 5559  suc csuc 6195  ‘cfv 6357  ωcom 7582  reccrdg 8047

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-om 7583  df-wrecs 7949  df-recs 8010  df-rdg 8048

This theorem is referenced by:  inf3lem3  9095