Theorem canthwe 10407

Description: The set of well-orders of a set 𝐴 strictly dominates 𝐴. A stronger form of canth2 8917. Corollary 1.4(b) of [KanamoriPincus] p. 417. (Contributed by Mario Carneiro, 31-May-2015.)

Hypothesis

Ref	Expression
canthwe.1	⊢ 𝑂 = {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)}

Assertion

Ref	Expression
canthwe	⊢ (𝐴 ∈ 𝑉 → 𝐴 ≺ 𝑂)

Distinct variable groups:   𝑥,𝑟,𝑂   𝑉,𝑟,𝑥   𝐴,𝑟,𝑥

Proof of Theorem canthwe

Dummy variables 𝑢 𝑦 𝑓 𝑣 𝑤 𝑎 𝑠 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1135	. . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑥 ⊆ 𝐴)
2		velpw 4538	. . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
3	1, 2	sylibr 233	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑥 ∈ 𝒫 𝐴)
4		simp2 1136	. . . . . . . . 9 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑟 ⊆ (𝑥 × 𝑥))
5		xpss12 5604	. . . . . . . . . 10 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝐴) → (𝑥 × 𝑥) ⊆ (𝐴 × 𝐴))
6	1, 1, 5	syl2anc 584	. . . . . . . . 9 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥 × 𝑥) ⊆ (𝐴 × 𝐴))
7	4, 6	sstrd 3931	. . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑟 ⊆ (𝐴 × 𝐴))
8		velpw 4538	. . . . . . . 8 ⊢ (𝑟 ∈ 𝒫 (𝐴 × 𝐴) ↔ 𝑟 ⊆ (𝐴 × 𝐴))
9	7, 8	sylibr 233	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑟 ∈ 𝒫 (𝐴 × 𝐴))
10	3, 9	jca 512	. . . . . 6 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴)))
11	10	ssopab2i 5463	. . . . 5 ⊢ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)} ⊆ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴))}
12		canthwe.1	. . . . 5 ⊢ 𝑂 = {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)}
13		df-xp 5595	. . . . 5 ⊢ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) = {⟨𝑥, 𝑟⟩ ∣ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴))}
14	11, 12, 13	3sstr4i 3964	. . . 4 ⊢ 𝑂 ⊆ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴))
15		pwexg 5301	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ V)
16		sqxpexg 7605	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V)
17	16	pwexd 5302	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 (𝐴 × 𝐴) ∈ V)
18	15, 17	xpexd 7601	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) ∈ V)
19		ssexg 5247	. . . 4 ⊢ ((𝑂 ⊆ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) ∧ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) ∈ V) → 𝑂 ∈ V)
20	14, 18, 19	sylancr 587	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝑂 ∈ V)
21		simpr 485	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → 𝑢 ∈ 𝐴)
22	21	snssd 4742	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → {𝑢} ⊆ 𝐴)
23		0ss 4330	. . . . . . . 8 ⊢ ∅ ⊆ ({𝑢} × {𝑢})
24	23	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → ∅ ⊆ ({𝑢} × {𝑢}))
25		rel0 5709	. . . . . . . 8 ⊢ Rel ∅
26		br0 5123	. . . . . . . . 9 ⊢ ¬ 𝑢∅𝑢
27		wesn 5675	. . . . . . . . 9 ⊢ (Rel ∅ → (∅ We {𝑢} ↔ ¬ 𝑢∅𝑢))
28	26, 27	mpbiri 257	. . . . . . . 8 ⊢ (Rel ∅ → ∅ We {𝑢})
29	25, 28	mp1i 13	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → ∅ We {𝑢})
30		snex 5354	. . . . . . . 8 ⊢ {𝑢} ∈ V
31		0ex 5231	. . . . . . . 8 ⊢ ∅ ∈ V
32		simpl 483	. . . . . . . . . 10 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → 𝑥 = {𝑢})
33	32	sseq1d 3952	. . . . . . . . 9 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → (𝑥 ⊆ 𝐴 ↔ {𝑢} ⊆ 𝐴))
34		simpr 485	. . . . . . . . . 10 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → 𝑟 = ∅)
35	32	sqxpeqd 5621	. . . . . . . . . 10 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → (𝑥 × 𝑥) = ({𝑢} × {𝑢}))
36	34, 35	sseq12d 3954	. . . . . . . . 9 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ ∅ ⊆ ({𝑢} × {𝑢})))
37		weeq2 5578	. . . . . . . . . 10 ⊢ (𝑥 = {𝑢} → (𝑟 We 𝑥 ↔ 𝑟 We {𝑢}))
38		weeq1 5577	. . . . . . . . . 10 ⊢ (𝑟 = ∅ → (𝑟 We {𝑢} ↔ ∅ We {𝑢}))
39	37, 38	sylan9bb 510	. . . . . . . . 9 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → (𝑟 We 𝑥 ↔ ∅ We {𝑢}))
40	33, 36, 39	3anbi123d 1435	. . . . . . . 8 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ↔ ({𝑢} ⊆ 𝐴 ∧ ∅ ⊆ ({𝑢} × {𝑢}) ∧ ∅ We {𝑢})))
41	30, 31, 40	opelopaba 5449	. . . . . . 7 ⊢ (⟨{𝑢}, ∅⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)} ↔ ({𝑢} ⊆ 𝐴 ∧ ∅ ⊆ ({𝑢} × {𝑢}) ∧ ∅ We {𝑢}))
42	22, 24, 29, 41	syl3anbrc 1342	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → ⟨{𝑢}, ∅⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)})
43	42, 12	eleqtrrdi 2850	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → ⟨{𝑢}, ∅⟩ ∈ 𝑂)
44	43	ex 413	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑢 ∈ 𝐴 → ⟨{𝑢}, ∅⟩ ∈ 𝑂))
45		eqid 2738	. . . . . . 7 ⊢ ∅ = ∅
46		snex 5354	. . . . . . . 8 ⊢ {𝑣} ∈ V
47	46, 31	opth2 5395	. . . . . . 7 ⊢ (⟨{𝑢}, ∅⟩ = ⟨{𝑣}, ∅⟩ ↔ ({𝑢} = {𝑣} ∧ ∅ = ∅))
48	45, 47	mpbiran2 707	. . . . . 6 ⊢ (⟨{𝑢}, ∅⟩ = ⟨{𝑣}, ∅⟩ ↔ {𝑢} = {𝑣})
49		sneqbg 4774	. . . . . . 7 ⊢ (𝑢 ∈ V → ({𝑢} = {𝑣} ↔ 𝑢 = 𝑣))
50	49	elv 3438	. . . . . 6 ⊢ ({𝑢} = {𝑣} ↔ 𝑢 = 𝑣)
51	48, 50	bitri 274	. . . . 5 ⊢ (⟨{𝑢}, ∅⟩ = ⟨{𝑣}, ∅⟩ ↔ 𝑢 = 𝑣)
52	51	2a1i 12	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (⟨{𝑢}, ∅⟩ = ⟨{𝑣}, ∅⟩ ↔ 𝑢 = 𝑣)))
53	44, 52	dom2d 8781	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑂 ∈ V → 𝐴 ≼ 𝑂))
54	20, 53	mpd 15	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ 𝑂)
55		eqid 2738	. . . . . . 7 ⊢ {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}
56	55	fpwwe2cbv 10386	. . . . . 6 ⊢ {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))} = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑤](𝑤𝑓(𝑟 ∩ (𝑤 × 𝑤))) = 𝑦))}
57		eqid 2738	. . . . . 6 ⊢ ∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))} = ∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}
58		eqid 2738	. . . . . 6 ⊢ (◡({⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}‘∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}) “ {(∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}𝑓({⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}‘∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}))}) = (◡({⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}‘∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}) “ {(∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}𝑓({⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}‘∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}))})
59	12, 56, 57, 58	canthwelem 10406	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝑓:𝑂–1-1→𝐴)
60		f1of1 6715	. . . . 5 ⊢ (𝑓:𝑂–1-1-onto→𝐴 → 𝑓:𝑂–1-1→𝐴)
61	59, 60	nsyl 140	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝑓:𝑂–1-1-onto→𝐴)
62	61	nexdv 1939	. . 3 ⊢ (𝐴 ∈ 𝑉 → ¬ ∃𝑓 𝑓:𝑂–1-1-onto→𝐴)
63		ensym 8789	. . . 4 ⊢ (𝐴 ≈ 𝑂 → 𝑂 ≈ 𝐴)
64		bren 8743	. . . 4 ⊢ (𝑂 ≈ 𝐴 ↔ ∃𝑓 𝑓:𝑂–1-1-onto→𝐴)
65	63, 64	sylib 217	. . 3 ⊢ (𝐴 ≈ 𝑂 → ∃𝑓 𝑓:𝑂–1-1-onto→𝐴)
66	62, 65	nsyl 140	. 2 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝐴 ≈ 𝑂)
67		brsdom 8763	. 2 ⊢ (𝐴 ≺ 𝑂 ↔ (𝐴 ≼ 𝑂 ∧ ¬ 𝐴 ≈ 𝑂))
68	54, 66, 67	sylanbrc 583	1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≺ 𝑂)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539  ∃wex 1782   ∈ wcel 2106  ∀wral 3064  Vcvv 3432  [wsbc 3716   ∩ cin 3886   ⊆ wss 3887  ∅c0 4256  𝒫 cpw 4533  {csn 4561  ⟨cop 4567  ∪ cuni 4839   class class class wbr 5074  {copab 5136   We wwe 5543   × cxp 5587  ^◡ccnv 5588  dom cdm 5589   “ cima 5592  Rel wrel 5594  –1-1→wf1 6430  –1-1-onto→wf1o 6432  ‘cfv 6433  (class class class)co 7275   ≈ cen 8730   ≼ cdom 8731   ≺ csdm 8732

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-oi 9269

This theorem is referenced by: (None)