Theorem acwer1prclem 35759

Description: Lemma for acwer1prc 35760. (Contributed by BTernaryTau, 31-Jul-2026.)

Hypothesis

Ref	Expression
acwer1prclem.1	⊢ 𝑊 = {𝑟 ∣ ∃𝑥 ∈ On (𝑟 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑟 We (𝑅1‘𝑥))}

Assertion

Ref	Expression
acwer1prclem	⊢ ((CHOICE ∧ ω ≼ 𝐴 ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → ∃𝑠((card‘𝑠) ∈ (card “ 𝑊) ∧ (card‘𝑠) = 𝐴))

Distinct variable groups:   𝐴,𝑠   𝐵,𝑠,𝑥   𝑠,𝑟,𝑥

Allowed substitution hints:   𝐴(𝑥, 𝑟)   𝐵(𝑟)   𝑊(𝑥, 𝑠, 𝑟)

Proof of Theorem acwer1prclem

Dummy variables 𝑤 𝑣 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1154	. . 3 ⊢ ((CHOICE ∧ ω ≼ 𝐴 ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → CHOICE)
2		breq2 5107	. . . . . . 7 ⊢ ((card‘(𝑅1‘𝐵)) = 𝐴 → (ω ≼ (card‘(𝑅1‘𝐵)) ↔ ω ≼ 𝐴))
3	2	biimpar 483	. . . . . 6 ⊢ (((card‘(𝑅1‘𝐵)) = 𝐴 ∧ ω ≼ 𝐴) → ω ≼ (card‘(𝑅1‘𝐵)))
4		fvex 6898	. . . . . . . . 9 ⊢ (𝑅1‘𝐵) ∈ V
5		acnum 35755	. . . . . . . . 9 ⊢ (CHOICE → ((𝑅1‘𝐵) ∈ V → (𝑅1‘𝐵) ∈ dom card))
6	4, 5	mpi 21	. . . . . . . 8 ⊢ (CHOICE → (𝑅1‘𝐵) ∈ dom card)
7		cardid2 10034	. . . . . . . . 9 ⊢ ((𝑅1‘𝐵) ∈ dom card → (card‘(𝑅1‘𝐵)) ≈ (𝑅1‘𝐵))
8		domentr 9040	. . . . . . . . 9 ⊢ ((ω ≼ (card‘(𝑅1‘𝐵)) ∧ (card‘(𝑅1‘𝐵)) ≈ (𝑅1‘𝐵)) → ω ≼ (𝑅1‘𝐵))
9	7, 8	sylan2 605	. . . . . . . 8 ⊢ ((ω ≼ (card‘(𝑅1‘𝐵)) ∧ (𝑅1‘𝐵) ∈ dom card) → ω ≼ (𝑅1‘𝐵))
10	6, 9	sylan2 605	. . . . . . 7 ⊢ ((ω ≼ (card‘(𝑅1‘𝐵)) ∧ CHOICE) → ω ≼ (𝑅1‘𝐵))
11	10	expcom 419	. . . . . 6 ⊢ (CHOICE → (ω ≼ (card‘(𝑅1‘𝐵)) → ω ≼ (𝑅1‘𝐵)))
12	3, 11	syl5 35	. . . . 5 ⊢ (CHOICE → (((card‘(𝑅1‘𝐵)) = 𝐴 ∧ ω ≼ 𝐴) → ω ≼ (𝑅1‘𝐵)))
13	12	ancomsd 471	. . . 4 ⊢ (CHOICE → ((ω ≼ 𝐴 ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → ω ≼ (𝑅1‘𝐵)))
14	13	3impib 1134	. . 3 ⊢ ((CHOICE ∧ ω ≼ 𝐴 ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → ω ≼ (𝑅1‘𝐵))
15		dfac8 10214	. . . . . 6 ⊢ (CHOICE ↔ ∀𝑧∃𝑦 𝑦 We 𝑧)
16		weeq2 5639	. . . . . . . 8 ⊢ (𝑧 = (𝑅1‘𝐵) → (𝑦 We 𝑧 ↔ 𝑦 We (𝑅1‘𝐵)))
17	16	exbidv 1954	. . . . . . 7 ⊢ (𝑧 = (𝑅1‘𝐵) → (∃𝑦 𝑦 We 𝑧 ↔ ∃𝑦 𝑦 We (𝑅1‘𝐵)))
18	4, 17	spcv 3560	. . . . . 6 ⊢ (∀𝑧∃𝑦 𝑦 We 𝑧 → ∃𝑦 𝑦 We (𝑅1‘𝐵))
19	15, 18	sylbi 220	. . . . 5 ⊢ (CHOICE → ∃𝑦 𝑦 We (𝑅1‘𝐵))
20		weexenwe 35756	. . . . 5 ⊢ ((∃𝑦 𝑦 We (𝑅1‘𝐵) ∧ ω ≼ (𝑅1‘𝐵)) → ∃𝑠(𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ 𝑠 ≈ (𝑅1‘𝐵)))
21	19, 20	sylan 592	. . . 4 ⊢ ((CHOICE ∧ ω ≼ (𝑅1‘𝐵)) → ∃𝑠(𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ 𝑠 ≈ (𝑅1‘𝐵)))
22		carden2b 10048	. . . . . 6 ⊢ (𝑠 ≈ (𝑅1‘𝐵) → (card‘𝑠) = (card‘(𝑅1‘𝐵)))
23	22	3anim3i 1172	. . . . 5 ⊢ ((𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ 𝑠 ≈ (𝑅1‘𝐵)) → (𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))))
24	23	eximi 1868	. . . 4 ⊢ (∃𝑠(𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ 𝑠 ≈ (𝑅1‘𝐵)) → ∃𝑠(𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))))
25	21, 24	syl 18	. . 3 ⊢ ((CHOICE ∧ ω ≼ (𝑅1‘𝐵)) → ∃𝑠(𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))))
26	1, 14, 25	syl2anc 596	. 2 ⊢ ((CHOICE ∧ ω ≼ 𝐴 ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → ∃𝑠(𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))))
27		df-3an 1105	. . . . 5 ⊢ ((𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))) ↔ ((𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵)) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))))
28		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐵 → (𝑅1‘𝑥) = (𝑅1‘𝐵))
29	28	sqxpeqd 5683	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐵 → ((𝑅1‘𝑥) × (𝑅1‘𝑥)) = ((𝑅1‘𝐵) × (𝑅1‘𝐵)))
30	29	sseq2d 3963	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ↔ 𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵))))
31		eqidd 2762	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐵 → 𝑠 = 𝑠)
32	31, 28	weeq12d 5640	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝑠 We (𝑅1‘𝑥) ↔ 𝑠 We (𝑅1‘𝐵)))
33	30, 32	anbi12d 644	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → ((𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥)) ↔ (𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵))))
34	33	rspcev 3577	. . . . . . . 8 ⊢ ((𝐵 ∈ On ∧ (𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵))) → ∃𝑥 ∈ On (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥)))
35		0elon 6418	. . . . . . . . 9 ⊢ ∅ ∈ On
36		r1fnon 9773	. . . . . . . . . . . . . . . . 17 ⊢ 𝑅1 Fn On
37	36	fndmi 6643	. . . . . . . . . . . . . . . 16 ⊢ dom 𝑅1 = On
38	37	eleq2i 2853	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ dom 𝑅1 ↔ 𝐵 ∈ On)
39		ndmfv 6917	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝐵 ∈ dom 𝑅1 → (𝑅1‘𝐵) = ∅)
40	38, 39	sylnbir 334	. . . . . . . . . . . . . 14 ⊢ (¬ 𝐵 ∈ On → (𝑅1‘𝐵) = ∅)
41		r10 9775	. . . . . . . . . . . . . 14 ⊢ (𝑅1‘∅) = ∅
42	40, 41	eqtr4di 2814	. . . . . . . . . . . . 13 ⊢ (¬ 𝐵 ∈ On → (𝑅1‘𝐵) = (𝑅1‘∅))
43	42	sqxpeqd 5683	. . . . . . . . . . . 12 ⊢ (¬ 𝐵 ∈ On → ((𝑅1‘𝐵) × (𝑅1‘𝐵)) = ((𝑅1‘∅) × (𝑅1‘∅)))
44	43	sseq2d 3963	. . . . . . . . . . 11 ⊢ (¬ 𝐵 ∈ On → (𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ↔ 𝑠 ⊆ ((𝑅1‘∅) × (𝑅1‘∅))))
45		eqidd 2762	. . . . . . . . . . . 12 ⊢ (¬ 𝐵 ∈ On → 𝑠 = 𝑠)
46	45, 42	weeq12d 5640	. . . . . . . . . . 11 ⊢ (¬ 𝐵 ∈ On → (𝑠 We (𝑅1‘𝐵) ↔ 𝑠 We (𝑅1‘∅)))
47	44, 46	anbi12d 644	. . . . . . . . . 10 ⊢ (¬ 𝐵 ∈ On → ((𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵)) ↔ (𝑠 ⊆ ((𝑅1‘∅) × (𝑅1‘∅)) ∧ 𝑠 We (𝑅1‘∅))))
48	47	biimpa 482	. . . . . . . . 9 ⊢ ((¬ 𝐵 ∈ On ∧ (𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵))) → (𝑠 ⊆ ((𝑅1‘∅) × (𝑅1‘∅)) ∧ 𝑠 We (𝑅1‘∅)))
49		fveq2 6885	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → (𝑅1‘𝑥) = (𝑅1‘∅))
50	49	sqxpeqd 5683	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → ((𝑅1‘𝑥) × (𝑅1‘𝑥)) = ((𝑅1‘∅) × (𝑅1‘∅)))
51	50	sseq2d 3963	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ↔ 𝑠 ⊆ ((𝑅1‘∅) × (𝑅1‘∅))))
52		eqidd 2762	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → 𝑠 = 𝑠)
53	52, 49	weeq12d 5640	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (𝑠 We (𝑅1‘𝑥) ↔ 𝑠 We (𝑅1‘∅)))
54	51, 53	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → ((𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥)) ↔ (𝑠 ⊆ ((𝑅1‘∅) × (𝑅1‘∅)) ∧ 𝑠 We (𝑅1‘∅))))
55	54	rspcev 3577	. . . . . . . . 9 ⊢ ((∅ ∈ On ∧ (𝑠 ⊆ ((𝑅1‘∅) × (𝑅1‘∅)) ∧ 𝑠 We (𝑅1‘∅))) → ∃𝑥 ∈ On (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥)))
56	35, 48, 55	sylancr 599	. . . . . . . 8 ⊢ ((¬ 𝐵 ∈ On ∧ (𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵))) → ∃𝑥 ∈ On (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥)))
57	34, 56	pm2.61ian 824	. . . . . . 7 ⊢ ((𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵)) → ∃𝑥 ∈ On (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥)))
58		vex 3455	. . . . . . . 8 ⊢ 𝑠 ∈ V
59		sseq1 3956	. . . . . . . . . 10 ⊢ (𝑟 = 𝑠 → (𝑟 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ↔ 𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥))))
60		weeq1 5638	. . . . . . . . . 10 ⊢ (𝑟 = 𝑠 → (𝑟 We (𝑅1‘𝑥) ↔ 𝑠 We (𝑅1‘𝑥)))
61	59, 60	anbi12d 644	. . . . . . . . 9 ⊢ (𝑟 = 𝑠 → ((𝑟 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑟 We (𝑅1‘𝑥)) ↔ (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥))))
62	61	rexbidv 3187	. . . . . . . 8 ⊢ (𝑟 = 𝑠 → (∃𝑥 ∈ On (𝑟 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑟 We (𝑅1‘𝑥)) ↔ ∃𝑥 ∈ On (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥))))
63		acwer1prclem.1	. . . . . . . 8 ⊢ 𝑊 = {𝑟 ∣ ∃𝑥 ∈ On (𝑟 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑟 We (𝑅1‘𝑥))}
64	58, 62, 63	elab2 3636	. . . . . . 7 ⊢ (𝑠 ∈ 𝑊 ↔ ∃𝑥 ∈ On (𝑠 ⊆ ((𝑅1‘𝑥) × (𝑅1‘𝑥)) ∧ 𝑠 We (𝑅1‘𝑥)))
65	57, 64	sylibr 237	. . . . . 6 ⊢ ((𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵)) → 𝑠 ∈ 𝑊)
66		acnum 35755	. . . . . . . 8 ⊢ (CHOICE → (𝑠 ∈ 𝑊 → 𝑠 ∈ dom card))
67		cardf2 10024	. . . . . . . . . 10 ⊢ card:{𝑣 ∣ ∃𝑤 ∈ On 𝑤 ≈ 𝑣}⟶On
68		ffun 6712	. . . . . . . . . 10 ⊢ (card:{𝑣 ∣ ∃𝑤 ∈ On 𝑤 ≈ 𝑣}⟶On → Fun card)
69	67, 68	ax-mp 5	. . . . . . . . 9 ⊢ Fun card
70		funfvima 7236	. . . . . . . . 9 ⊢ ((Fun card ∧ 𝑠 ∈ dom card) → (𝑠 ∈ 𝑊 → (card‘𝑠) ∈ (card “ 𝑊)))
71	69, 70	mpan 703	. . . . . . . 8 ⊢ (𝑠 ∈ dom card → (𝑠 ∈ 𝑊 → (card‘𝑠) ∈ (card “ 𝑊)))
72	66, 71	syli 40	. . . . . . 7 ⊢ (CHOICE → (𝑠 ∈ 𝑊 → (card‘𝑠) ∈ (card “ 𝑊)))
73		eqtr 2781	. . . . . . . 8 ⊢ (((card‘𝑠) = (card‘(𝑅1‘𝐵)) ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → (card‘𝑠) = 𝐴)
74	73	expcom 419	. . . . . . 7 ⊢ ((card‘(𝑅1‘𝐵)) = 𝐴 → ((card‘𝑠) = (card‘(𝑅1‘𝐵)) → (card‘𝑠) = 𝐴))
75	72, 74	im2anan9 632	. . . . . 6 ⊢ ((CHOICE ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → ((𝑠 ∈ 𝑊 ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))) → ((card‘𝑠) ∈ (card “ 𝑊) ∧ (card‘𝑠) = 𝐴)))
76	65, 75	sylani 616	. . . . 5 ⊢ ((CHOICE ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → (((𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵)) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))) → ((card‘𝑠) ∈ (card “ 𝑊) ∧ (card‘𝑠) = 𝐴)))
77	27, 76	biimtrid 245	. . . 4 ⊢ ((CHOICE ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → ((𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))) → ((card‘𝑠) ∈ (card “ 𝑊) ∧ (card‘𝑠) = 𝐴)))
78	77	eximdv 1950	. . 3 ⊢ ((CHOICE ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → (∃𝑠(𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))) → ∃𝑠((card‘𝑠) ∈ (card “ 𝑊) ∧ (card‘𝑠) = 𝐴)))
79	78	3adant2 1149	. 2 ⊢ ((CHOICE ∧ ω ≼ 𝐴 ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → (∃𝑠(𝑠 ⊆ ((𝑅1‘𝐵) × (𝑅1‘𝐵)) ∧ 𝑠 We (𝑅1‘𝐵) ∧ (card‘𝑠) = (card‘(𝑅1‘𝐵))) → ∃𝑠((card‘𝑠) ∈ (card “ 𝑊) ∧ (card‘𝑠) = 𝐴)))
80	26, 79	mpd 16	1 ⊢ ((CHOICE ∧ ω ≼ 𝐴 ∧ (card‘(𝑅1‘𝐵)) = 𝐴) → ∃𝑠((card‘𝑠) ∈ (card “ 𝑊) ∧ (card‘𝑠) = 𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2739  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  ∅c0 4279   class class class wbr 5103   We wwe 5603   × cxp 5649  dom cdm 5651   “ cima 5654  Oncon0 6362  Fun wfun 6532  ⟶wf 6534  ‘cfv 6538  ωcom 7877   ≈ cen 8970   ≼ cdom 8971  𝑅₁cr1 9766  cardccrd 10016  CHOICEwac 10194

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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-inf2 9642

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7377  df-ov 7423  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-oi 9504  df-r1 9768  df-card 10020  df-ac 10195

This theorem is used by:  acwer1prc  35760