Theorem inf3lem6 9562

Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 9564 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
inf3lem6	⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → 𝐹:ω–1-1→𝒫 𝑥)

Distinct variable group:   𝑥,𝑦,𝑤

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

Proof of Theorem inf3lem6

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

Step	Hyp	Ref	Expression
1		inf3lem.1	. . . . . . . . . . 11 ⊢ 𝐺 = (𝑦 ∈ V ↦ {𝑤 ∈ 𝑥 ∣ (𝑤 ∩ 𝑥) ⊆ 𝑦})
2		inf3lem.2	. . . . . . . . . . 11 ⊢ 𝐹 = (rec(𝐺, ∅) ↾ ω)
3		vex 3448	. . . . . . . . . . 11 ⊢ 𝑢 ∈ V
4		vex 3448	. . . . . . . . . . 11 ⊢ 𝑣 ∈ V
5	1, 2, 3, 4	inf3lem5 9561	. . . . . . . . . 10 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝑢 ∈ ω ∧ 𝑣 ∈ 𝑢) → (𝐹‘𝑣) ⊊ (𝐹‘𝑢)))
6		dfpss2 4047	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑣) ⊊ (𝐹‘𝑢) ↔ ((𝐹‘𝑣) ⊆ (𝐹‘𝑢) ∧ ¬ (𝐹‘𝑣) = (𝐹‘𝑢)))
7	6	simprbi 496	. . . . . . . . . 10 ⊢ ((𝐹‘𝑣) ⊊ (𝐹‘𝑢) → ¬ (𝐹‘𝑣) = (𝐹‘𝑢))
8	5, 7	syl6 35	. . . . . . . . 9 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝑢 ∈ ω ∧ 𝑣 ∈ 𝑢) → ¬ (𝐹‘𝑣) = (𝐹‘𝑢)))
9	8	expdimp 452	. . . . . . . 8 ⊢ (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ∧ 𝑢 ∈ ω) → (𝑣 ∈ 𝑢 → ¬ (𝐹‘𝑣) = (𝐹‘𝑢)))
10	9	adantrl 716	. . . . . . 7 ⊢ (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ∧ (𝑣 ∈ ω ∧ 𝑢 ∈ ω)) → (𝑣 ∈ 𝑢 → ¬ (𝐹‘𝑣) = (𝐹‘𝑢)))
11	1, 2, 4, 3	inf3lem5 9561	. . . . . . . . . 10 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝑣 ∈ ω ∧ 𝑢 ∈ 𝑣) → (𝐹‘𝑢) ⊊ (𝐹‘𝑣)))
12		dfpss2 4047	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑢) ⊊ (𝐹‘𝑣) ↔ ((𝐹‘𝑢) ⊆ (𝐹‘𝑣) ∧ ¬ (𝐹‘𝑢) = (𝐹‘𝑣)))
13	12	simprbi 496	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑢) ⊊ (𝐹‘𝑣) → ¬ (𝐹‘𝑢) = (𝐹‘𝑣))
14		eqcom 2736	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑢) = (𝐹‘𝑣) ↔ (𝐹‘𝑣) = (𝐹‘𝑢))
15	13, 14	sylnib 328	. . . . . . . . . 10 ⊢ ((𝐹‘𝑢) ⊊ (𝐹‘𝑣) → ¬ (𝐹‘𝑣) = (𝐹‘𝑢))
16	11, 15	syl6 35	. . . . . . . . 9 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ((𝑣 ∈ ω ∧ 𝑢 ∈ 𝑣) → ¬ (𝐹‘𝑣) = (𝐹‘𝑢)))
17	16	expdimp 452	. . . . . . . 8 ⊢ (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ∧ 𝑣 ∈ ω) → (𝑢 ∈ 𝑣 → ¬ (𝐹‘𝑣) = (𝐹‘𝑢)))
18	17	adantrr 717	. . . . . . 7 ⊢ (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ∧ (𝑣 ∈ ω ∧ 𝑢 ∈ ω)) → (𝑢 ∈ 𝑣 → ¬ (𝐹‘𝑣) = (𝐹‘𝑢)))
19	10, 18	jaod 859	. . . . . 6 ⊢ (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ∧ (𝑣 ∈ ω ∧ 𝑢 ∈ ω)) → ((𝑣 ∈ 𝑢 ∨ 𝑢 ∈ 𝑣) → ¬ (𝐹‘𝑣) = (𝐹‘𝑢)))
20	19	con2d 134	. . . . 5 ⊢ (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ∧ (𝑣 ∈ ω ∧ 𝑢 ∈ ω)) → ((𝐹‘𝑣) = (𝐹‘𝑢) → ¬ (𝑣 ∈ 𝑢 ∨ 𝑢 ∈ 𝑣)))
21		nnord 7830	. . . . . . 7 ⊢ (𝑣 ∈ ω → Ord 𝑣)
22		nnord 7830	. . . . . . 7 ⊢ (𝑢 ∈ ω → Ord 𝑢)
23		ordtri3 6356	. . . . . . 7 ⊢ ((Ord 𝑣 ∧ Ord 𝑢) → (𝑣 = 𝑢 ↔ ¬ (𝑣 ∈ 𝑢 ∨ 𝑢 ∈ 𝑣)))
24	21, 22, 23	syl2an 596	. . . . . 6 ⊢ ((𝑣 ∈ ω ∧ 𝑢 ∈ ω) → (𝑣 = 𝑢 ↔ ¬ (𝑣 ∈ 𝑢 ∨ 𝑢 ∈ 𝑣)))
25	24	adantl 481	. . . . 5 ⊢ (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ∧ (𝑣 ∈ ω ∧ 𝑢 ∈ ω)) → (𝑣 = 𝑢 ↔ ¬ (𝑣 ∈ 𝑢 ∨ 𝑢 ∈ 𝑣)))
26	20, 25	sylibrd 259	. . . 4 ⊢ (((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ∧ (𝑣 ∈ ω ∧ 𝑢 ∈ ω)) → ((𝐹‘𝑣) = (𝐹‘𝑢) → 𝑣 = 𝑢))
27	26	ralrimivva 3178	. . 3 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → ∀𝑣 ∈ ω ∀𝑢 ∈ ω ((𝐹‘𝑣) = (𝐹‘𝑢) → 𝑣 = 𝑢))
28		frfnom 8380	. . . . . 6 ⊢ (rec(𝐺, ∅) ↾ ω) Fn ω
29		fneq1 6591	. . . . . 6 ⊢ (𝐹 = (rec(𝐺, ∅) ↾ ω) → (𝐹 Fn ω ↔ (rec(𝐺, ∅) ↾ ω) Fn ω))
30	28, 29	mpbiri 258	. . . . 5 ⊢ (𝐹 = (rec(𝐺, ∅) ↾ ω) → 𝐹 Fn ω)
31		fvelrnb 6903	. . . . . . . 8 ⊢ (𝐹 Fn ω → (𝑢 ∈ ran 𝐹 ↔ ∃𝑣 ∈ ω (𝐹‘𝑣) = 𝑢))
32		inf3lem.4	. . . . . . . . . . . 12 ⊢ 𝐵 ∈ V
33	1, 2, 4, 32	inf3lemd 9556	. . . . . . . . . . 11 ⊢ (𝑣 ∈ ω → (𝐹‘𝑣) ⊆ 𝑥)
34		fvex 6853	. . . . . . . . . . . 12 ⊢ (𝐹‘𝑣) ∈ V
35	34	elpw 4563	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑣) ∈ 𝒫 𝑥 ↔ (𝐹‘𝑣) ⊆ 𝑥)
36	33, 35	sylibr 234	. . . . . . . . . 10 ⊢ (𝑣 ∈ ω → (𝐹‘𝑣) ∈ 𝒫 𝑥)
37		eleq1 2816	. . . . . . . . . 10 ⊢ ((𝐹‘𝑣) = 𝑢 → ((𝐹‘𝑣) ∈ 𝒫 𝑥 ↔ 𝑢 ∈ 𝒫 𝑥))
38	36, 37	syl5ibcom 245	. . . . . . . . 9 ⊢ (𝑣 ∈ ω → ((𝐹‘𝑣) = 𝑢 → 𝑢 ∈ 𝒫 𝑥))
39	38	rexlimiv 3127	. . . . . . . 8 ⊢ (∃𝑣 ∈ ω (𝐹‘𝑣) = 𝑢 → 𝑢 ∈ 𝒫 𝑥)
40	31, 39	biimtrdi 253	. . . . . . 7 ⊢ (𝐹 Fn ω → (𝑢 ∈ ran 𝐹 → 𝑢 ∈ 𝒫 𝑥))
41	40	ssrdv 3949	. . . . . 6 ⊢ (𝐹 Fn ω → ran 𝐹 ⊆ 𝒫 𝑥)
42	41	ancli 548	. . . . 5 ⊢ (𝐹 Fn ω → (𝐹 Fn ω ∧ ran 𝐹 ⊆ 𝒫 𝑥))
43	2, 30, 42	mp2b 10	. . . 4 ⊢ (𝐹 Fn ω ∧ ran 𝐹 ⊆ 𝒫 𝑥)
44		df-f 6503	. . . 4 ⊢ (𝐹:ω⟶𝒫 𝑥 ↔ (𝐹 Fn ω ∧ ran 𝐹 ⊆ 𝒫 𝑥))
45	43, 44	mpbir 231	. . 3 ⊢ 𝐹:ω⟶𝒫 𝑥
46	27, 45	jctil 519	. 2 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → (𝐹:ω⟶𝒫 𝑥 ∧ ∀𝑣 ∈ ω ∀𝑢 ∈ ω ((𝐹‘𝑣) = (𝐹‘𝑢) → 𝑣 = 𝑢)))
47		dff13 7211	. 2 ⊢ (𝐹:ω–1-1→𝒫 𝑥 ↔ (𝐹:ω⟶𝒫 𝑥 ∧ ∀𝑣 ∈ ω ∀𝑢 ∈ ω ((𝐹‘𝑣) = (𝐹‘𝑢) → 𝑣 = 𝑢)))
48	46, 47	sylibr 234	1 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) → 𝐹:ω–1-1→𝒫 𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∃wrex 3053  {crab 3402  Vcvv 3444   ∩ cin 3910   ⊆ wss 3911   ⊊ wpss 3912  ∅c0 4292  𝒫 cpw 4559  ∪ cuni 4867   ↦ cmpt 5183  ran crn 5632   ↾ cres 5633  Ord word 6319   Fn wfn 6494  ⟶wf 6495  –1-1→wf1 6496  ‘cfv 6499  ωcom 7822  reccrdg 8354

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 5246  ax-nul 5256  ax-pr 5382  ax-un 7691  ax-reg 9521

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 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7372  df-om 7823  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355

This theorem is referenced by:  inf3lem7  9563  dominf  10374  dominfac  10502