Theorem canthwe 10664

Description: The set of well-orders of a set 𝐴 strictly dominates 𝐴. A stronger form of canth2 9132. 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 1154	. . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑥 ⊆ 𝐴)
2		velpw 4565	. . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
3	1, 2	sylibr 237	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑥 ∈ 𝒫 𝐴)
4		simp2 1155	. . . . . . . . 9 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑟 ⊆ (𝑥 × 𝑥))
5		xpss12 5674	. . . . . . . . . 10 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝐴) → (𝑥 × 𝑥) ⊆ (𝐴 × 𝐴))
6	1, 1, 5	syl2anc 596	. . . . . . . . 9 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥 × 𝑥) ⊆ (𝐴 × 𝐴))
7	4, 6	sstrd 3944	. . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑟 ⊆ (𝐴 × 𝐴))
8		velpw 4565	. . . . . . . 8 ⊢ (𝑟 ∈ 𝒫 (𝐴 × 𝐴) ↔ 𝑟 ⊆ (𝐴 × 𝐴))
9	7, 8	sylibr 237	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑟 ∈ 𝒫 (𝐴 × 𝐴))
10	3, 9	jca 521	. . . . . 6 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴)))
11	10	ssopab2i 5533	. . . . 5 ⊢ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)} ⊆ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴))}
12		canthwe.1	. . . . 5 ⊢ 𝑂 = {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)}
13		df-xp 5665	. . . . 5 ⊢ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) = {⟨𝑥, 𝑟⟩ ∣ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴))}
14	11, 12, 13	3sstr4i 3985	. . . 4 ⊢ 𝑂 ⊆ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴))
15		pwexg 5347	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ V)
16		sqxpexg 7758	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V)
17	16	pwexd 5348	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝒫 (𝐴 × 𝐴) ∈ V)
18	15, 17	xpexd 7754	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) ∈ V)
19		ssexg 5288	. . . 4 ⊢ ((𝑂 ⊆ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) ∧ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) ∈ V) → 𝑂 ∈ V)
20	14, 18, 19	sylancr 599	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝑂 ∈ V)
21		simpr 490	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → 𝑢 ∈ 𝐴)
22	21	snssd 4750	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → {𝑢} ⊆ 𝐴)
23		0ss 4353	. . . . . . . 8 ⊢ ∅ ⊆ ({𝑢} × {𝑢})
24	23	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → ∅ ⊆ ({𝑢} × {𝑢}))
25		rel0 5783	. . . . . . . 8 ⊢ Rel ∅
26		br0 5158	. . . . . . . . 9 ⊢ ¬ 𝑢∅𝑢
27		wesn 5748	. . . . . . . . 9 ⊢ (Rel ∅ → (∅ We {𝑢} ↔ ¬ 𝑢∅𝑢))
28	26, 27	mpbiri 261	. . . . . . . 8 ⊢ (Rel ∅ → ∅ We {𝑢})
29	25, 28	mp1i 14	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → ∅ We {𝑢})
30		vsnex 5404	. . . . . . . 8 ⊢ {𝑢} ∈ V
31		0ex 5268	. . . . . . . 8 ⊢ ∅ ∈ V
32		simpl 488	. . . . . . . . . 10 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → 𝑥 = {𝑢})
33	32	sseq1d 3965	. . . . . . . . 9 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → (𝑥 ⊆ 𝐴 ↔ {𝑢} ⊆ 𝐴))
34		simpr 490	. . . . . . . . . 10 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → 𝑟 = ∅)
35	32	sqxpeqd 5691	. . . . . . . . . 10 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → (𝑥 × 𝑥) = ({𝑢} × {𝑢}))
36	34, 35	sseq12d 3967	. . . . . . . . 9 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ ∅ ⊆ ({𝑢} × {𝑢})))
37	34, 32	weeq12d 5648	. . . . . . . . 9 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → (𝑟 We 𝑥 ↔ ∅ We {𝑢}))
38	33, 36, 37	3anbi123d 1464	. . . . . . . 8 ⊢ ((𝑥 = {𝑢} ∧ 𝑟 = ∅) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ↔ ({𝑢} ⊆ 𝐴 ∧ ∅ ⊆ ({𝑢} × {𝑢}) ∧ ∅ We {𝑢})))
39	30, 31, 38	opelopaba 5518	. . . . . . 7 ⊢ (⟨{𝑢}, ∅⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)} ↔ ({𝑢} ⊆ 𝐴 ∧ ∅ ⊆ ({𝑢} × {𝑢}) ∧ ∅ We {𝑢}))
40	22, 24, 29, 39	syl3anbrc 1362	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → ⟨{𝑢}, ∅⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)})
41	40, 12	eleqtrrdi 2873	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ 𝐴) → ⟨{𝑢}, ∅⟩ ∈ 𝑂)
42	41	ex 418	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑢 ∈ 𝐴 → ⟨{𝑢}, ∅⟩ ∈ 𝑂))
43		eqid 2762	. . . . . . 7 ⊢ ∅ = ∅
44		vsnex 5404	. . . . . . . 8 ⊢ {𝑣} ∈ V
45	44, 31	opth2 5460	. . . . . . 7 ⊢ (⟨{𝑢}, ∅⟩ = ⟨{𝑣}, ∅⟩ ↔ ({𝑢} = {𝑣} ∧ ∅ = ∅))
46	43, 45	mpbiran2 723	. . . . . 6 ⊢ (⟨{𝑢}, ∅⟩ = ⟨{𝑣}, ∅⟩ ↔ {𝑢} = {𝑣})
47		sneqbg 4806	. . . . . . 7 ⊢ (𝑢 ∈ V → ({𝑢} = {𝑣} ↔ 𝑢 = 𝑣))
48	47	elv 3458	. . . . . 6 ⊢ ({𝑢} = {𝑣} ↔ 𝑢 = 𝑣)
49	46, 48	bitri 278	. . . . 5 ⊢ (⟨{𝑢}, ∅⟩ = ⟨{𝑣}, ∅⟩ ↔ 𝑢 = 𝑣)
50	49	2a1i 12	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (⟨{𝑢}, ∅⟩ = ⟨{𝑣}, ∅⟩ ↔ 𝑢 = 𝑣)))
51	42, 50	dom2d 9003	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑂 ∈ V → 𝐴 ≼ 𝑂))
52	20, 51	mpd 16	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≼ 𝑂)
53		eqid 2762	. . . . . . 7 ⊢ {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}
54	53	fpwwe2cbv 10643	. . . . . 6 ⊢ {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))} = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑤](𝑤𝑓(𝑟 ∩ (𝑤 × 𝑤))) = 𝑦))}
55		eqid 2762	. . . . . 6 ⊢ ∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))} = ∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}
56		eqid 2762	. . . . . 6 ⊢ (◡({⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}‘∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}) “ {(∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}𝑓({⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}‘∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}))}) = (◡({⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}‘∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}) “ {(∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}𝑓({⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}‘∪ dom {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝑓(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}))})
57	12, 54, 55, 56	canthwelem 10663	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝑓:𝑂–1-1→𝐴)
58		f1of1 6820	. . . . 5 ⊢ (𝑓:𝑂–1-1-onto→𝐴 → 𝑓:𝑂–1-1→𝐴)
59	57, 58	nsyl 141	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝑓:𝑂–1-1-onto→𝐴)
60	59	nexdv 1969	. . 3 ⊢ (𝐴 ∈ 𝑉 → ¬ ∃𝑓 𝑓:𝑂–1-1-onto→𝐴)
61		ensym 9013	. . . 4 ⊢ (𝐴 ≈ 𝑂 → 𝑂 ≈ 𝐴)
62		bren 8966	. . . 4 ⊢ (𝑂 ≈ 𝐴 ↔ ∃𝑓 𝑓:𝑂–1-1-onto→𝐴)
63	61, 62	sylib 221	. . 3 ⊢ (𝐴 ≈ 𝑂 → ∃𝑓 𝑓:𝑂–1-1-onto→𝐴)
64	60, 63	nsyl 141	. 2 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝐴 ≈ 𝑂)
65		brsdom 8984	. 2 ⊢ (𝐴 ≺ 𝑂 ↔ (𝐴 ≼ 𝑂 ∧ ¬ 𝐴 ≈ 𝑂))
66	52, 64, 65	sylanbrc 595	1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≺ 𝑂)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3078  Vcvv 3453  [wsbc 3742   ∩ cin 3901   ⊆ wss 3902  ∅c0 4282  𝒫 cpw 4560  {csn 4587  ⟨cop 4593  ∪ cuni 4870   class class class wbr 5107  {copab 5171   We wwe 5611   × cxp 5657  ^◡ccnv 5658  dom cdm 5659   “ cima 5662  Rel wrel 5664  –1-1→wf1 6534  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7417   ≈ cen 8953   ≼ cdom 8954   ≺ csdm 8955

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7374  df-ov 7420  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-er 8700  df-en 8957  df-dom 8958  df-sdom 8959  df-oi 9486

This theorem is used by: (None)