Theorem infmap2 10207

Description: An exponentiation law for infinite cardinals. Similar to Lemma 6.2 of [Jech] p. 43. Although this version of infmap 10567 avoids the axiom of choice, it requires the powerset of an infinite set to be well-orderable and so is usually not applicable. (Contributed by NM, 1-Oct-2004.) (Revised by Mario Carneiro, 30-Apr-2015.)

Assertion

Ref	Expression
infmap2	⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → (𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem infmap2

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7420	. . 3 ⊢ (𝐵 = ∅ → (𝐴 ↑m 𝐵) = (𝐴 ↑m ∅))
2		breq2 5112	. . . . 5 ⊢ (𝐵 = ∅ → (𝑥 ≈ 𝐵 ↔ 𝑥 ≈ ∅))
3	2	anbi2d 641	. . . 4 ⊢ (𝐵 = ∅ → ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵) ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)))
4	3	abbidv 2828	. . 3 ⊢ (𝐵 = ∅ → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)})
5	1, 4	breq12d 5121	. 2 ⊢ (𝐵 = ∅ → ((𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ↔ (𝐴 ↑m ∅) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)}))
6		simpl2 1210	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐵 ≼ 𝐴)
7		reldom 8947	. . . . . . . . . . 11 ⊢ Rel ≼
8	7	brrelex1i 5716	. . . . . . . . . 10 ⊢ (𝐵 ≼ 𝐴 → 𝐵 ∈ V)
9	6, 8	syl 18	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐵 ∈ V)
10	7	brrelex2i 5717	. . . . . . . . . 10 ⊢ (𝐵 ≼ 𝐴 → 𝐴 ∈ V)
11	6, 10	syl 18	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐴 ∈ V)
12		xpcomeng 9055	. . . . . . . . 9 ⊢ ((𝐵 ∈ V ∧ 𝐴 ∈ V) → (𝐵 × 𝐴) ≈ (𝐴 × 𝐵))
13	9, 11, 12	syl2anc 595	. . . . . . . 8 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐵 × 𝐴) ≈ (𝐴 × 𝐵))
14		simpl3 1211	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 ↑m 𝐵) ∈ dom card)
15		simpr 489	. . . . . . . . . . 11 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐵 ≠ ∅)
16		mapdom3 9135	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵))
17	11, 9, 15, 16	syl3anc 1397	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵))
18		numdom 10029	. . . . . . . . . 10 ⊢ (((𝐴 ↑m 𝐵) ∈ dom card ∧ 𝐴 ≼ (𝐴 ↑m 𝐵)) → 𝐴 ∈ dom card)
19	14, 17, 18	syl2anc 595	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐴 ∈ dom card)
20		simpl1 1209	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → ω ≼ 𝐴)
21		infxpabs 10201	. . . . . . . . 9 ⊢ (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ≠ ∅ ∧ 𝐵 ≼ 𝐴)) → (𝐴 × 𝐵) ≈ 𝐴)
22	19, 20, 15, 6, 21	syl22anc 851	. . . . . . . 8 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 × 𝐵) ≈ 𝐴)
23		entr 9001	. . . . . . . 8 ⊢ (((𝐵 × 𝐴) ≈ (𝐴 × 𝐵) ∧ (𝐴 × 𝐵) ≈ 𝐴) → (𝐵 × 𝐴) ≈ 𝐴)
24	13, 22, 23	syl2anc 595	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐵 × 𝐴) ≈ 𝐴)
25		ssenen 9137	. . . . . . 7 ⊢ ((𝐵 × 𝐴) ≈ 𝐴 → {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
26	24, 25	syl 18	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
27		relen 8946	. . . . . . 7 ⊢ Rel ≈
28	27	brrelex1i 5716	. . . . . 6 ⊢ ({𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} → {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ∈ V)
29	26, 28	syl 18	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ∈ V)
30		abid2 2899	. . . . . 6 ⊢ {𝑥 ∣ 𝑥 ∈ (𝐴 ↑m 𝐵)} = (𝐴 ↑m 𝐵)
31		elmapi 8844	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ↑m 𝐵) → 𝑥:𝐵⟶𝐴)
32		fssxp 6733	. . . . . . . . 9 ⊢ (𝑥:𝐵⟶𝐴 → 𝑥 ⊆ (𝐵 × 𝐴))
33		ffun 6708	. . . . . . . . . . 11 ⊢ (𝑥:𝐵⟶𝐴 → Fun 𝑥)
34		vex 3458	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
35	34	fundmen 9026	. . . . . . . . . . 11 ⊢ (Fun 𝑥 → dom 𝑥 ≈ 𝑥)
36		ensym 8998	. . . . . . . . . . 11 ⊢ (dom 𝑥 ≈ 𝑥 → 𝑥 ≈ dom 𝑥)
37	33, 35, 36	3syl 19	. . . . . . . . . 10 ⊢ (𝑥:𝐵⟶𝐴 → 𝑥 ≈ dom 𝑥)
38		fdm 6715	. . . . . . . . . 10 ⊢ (𝑥:𝐵⟶𝐴 → dom 𝑥 = 𝐵)
39	37, 38	breqtrd 5136	. . . . . . . . 9 ⊢ (𝑥:𝐵⟶𝐴 → 𝑥 ≈ 𝐵)
40	32, 39	jca 520	. . . . . . . 8 ⊢ (𝑥:𝐵⟶𝐴 → (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵))
41	31, 40	syl 18	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ↑m 𝐵) → (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵))
42	41	ss2abi 4019	. . . . . 6 ⊢ {𝑥 ∣ 𝑥 ∈ (𝐴 ↑m 𝐵)} ⊆ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)}
43	30, 42	eqsstrri 3983	. . . . 5 ⊢ (𝐴 ↑m 𝐵) ⊆ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)}
44		ssdomg 8995	. . . . 5 ⊢ ({𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ∈ V → ((𝐴 ↑m 𝐵) ⊆ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} → (𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)}))
45	29, 43, 44	mpisyl 22	. . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)})
46		domentr 9008	. . . 4 ⊢ (((𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ∧ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)}) → (𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
47	45, 26, 46	syl2anc 595	. . 3 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
48		ovex 7445	. . . . . . 7 ⊢ (𝐴 ↑m 𝐵) ∈ V
49	48	mptex 7221	. . . . . 6 ⊢ (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ∈ V
50	49	rnex 7905	. . . . 5 ⊢ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ∈ V
51		ensym 8998	. . . . . . . . . . . 12 ⊢ (𝑥 ≈ 𝐵 → 𝐵 ≈ 𝑥)
52	51	ad2antll 741	. . . . . . . . . . 11 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → 𝐵 ≈ 𝑥)
53		bren 8951	. . . . . . . . . . 11 ⊢ (𝐵 ≈ 𝑥 ↔ ∃𝑓 𝑓:𝐵–1-1-onto→𝑥)
54	52, 53	sylib 221	. . . . . . . . . 10 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → ∃𝑓 𝑓:𝐵–1-1-onto→𝑥)
55		f1of 6820	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:𝐵–1-1-onto→𝑥 → 𝑓:𝐵⟶𝑥)
56	55	adantl 486	. . . . . . . . . . . . . . 15 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑓:𝐵⟶𝑥)
57		simplrl 788	. . . . . . . . . . . . . . 15 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑥 ⊆ 𝐴)
58	56, 57	fssd 6723	. . . . . . . . . . . . . 14 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑓:𝐵⟶𝐴)
59	11, 9	elmapd 8835	. . . . . . . . . . . . . . 15 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝑓 ∈ (𝐴 ↑m 𝐵) ↔ 𝑓:𝐵⟶𝐴))
60	59	ad2antrr 738	. . . . . . . . . . . . . 14 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → (𝑓 ∈ (𝐴 ↑m 𝐵) ↔ 𝑓:𝐵⟶𝐴))
61	58, 60	mpbird 260	. . . . . . . . . . . . 13 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑓 ∈ (𝐴 ↑m 𝐵))
62		f1ofo 6828	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:𝐵–1-1-onto→𝑥 → 𝑓:𝐵–onto→𝑥)
63		forn 6795	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:𝐵–onto→𝑥 → ran 𝑓 = 𝑥)
64	62, 63	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐵–1-1-onto→𝑥 → ran 𝑓 = 𝑥)
65	64	adantl 486	. . . . . . . . . . . . . 14 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → ran 𝑓 = 𝑥)
66	65	eqcomd 2768	. . . . . . . . . . . . 13 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑥 = ran 𝑓)
67	61, 66	jca 520	. . . . . . . . . . . 12 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → (𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓))
68	67	ex 417	. . . . . . . . . . 11 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → (𝑓:𝐵–1-1-onto→𝑥 → (𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓)))
69	68	eximdv 1946	. . . . . . . . . 10 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → (∃𝑓 𝑓:𝐵–1-1-onto→𝑥 → ∃𝑓(𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓)))
70	54, 69	mpd 16	. . . . . . . . 9 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → ∃𝑓(𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓))
71		df-rex 3089	. . . . . . . . 9 ⊢ (∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓 ↔ ∃𝑓(𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓))
72	70, 71	sylibr 237	. . . . . . . 8 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → ∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓)
73	72	ex 417	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵) → ∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓))
74	73	ss2abdv 4018	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ⊆ {𝑥 ∣ ∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓})
75		eqid 2762	. . . . . . 7 ⊢ (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) = (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓)
76	75	rnmpt 5946	. . . . . 6 ⊢ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) = {𝑥 ∣ ∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓}
77	74, 76	sseqtrrdi 3977	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ⊆ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓))
78		ssdomg 8995	. . . . 5 ⊢ (ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ∈ V → ({𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ⊆ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓)))
79	50, 77, 78	mpsyl 69	. . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓))
80		vex 3458	. . . . . . . . 9 ⊢ 𝑓 ∈ V
81	80	rnex 7905	. . . . . . . 8 ⊢ ran 𝑓 ∈ V
82	81	rgenw 3082	. . . . . . 7 ⊢ ∀𝑓 ∈ (𝐴 ↑m 𝐵)ran 𝑓 ∈ V
83	75	fnmpt 6675	. . . . . . 7 ⊢ (∀𝑓 ∈ (𝐴 ↑m 𝐵)ran 𝑓 ∈ V → (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) Fn (𝐴 ↑m 𝐵))
84	82, 83	mp1i 14	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) Fn (𝐴 ↑m 𝐵))
85		dffn4 6798	. . . . . 6 ⊢ ((𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) Fn (𝐴 ↑m 𝐵) ↔ (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓):(𝐴 ↑m 𝐵)–onto→ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓))
86	84, 85	sylib 221	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓):(𝐴 ↑m 𝐵)–onto→ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓))
87		fodomnum 10048	. . . . 5 ⊢ ((𝐴 ↑m 𝐵) ∈ dom card → ((𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓):(𝐴 ↑m 𝐵)–onto→ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) → ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ≼ (𝐴 ↑m 𝐵)))
88	14, 86, 87	sylc 66	. . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ≼ (𝐴 ↑m 𝐵))
89		domtr 9002	. . . 4 ⊢ (({𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ∧ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ≼ (𝐴 ↑m 𝐵)) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ (𝐴 ↑m 𝐵))
90	79, 88, 89	syl2anc 595	. . 3 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ (𝐴 ↑m 𝐵))
91		sbth 9083	. . 3 ⊢ (((𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ∧ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ (𝐴 ↑m 𝐵)) → (𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
92	47, 90, 91	syl2anc 595	. 2 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
93	7	brrelex2i 5717	. . . . 5 ⊢ (ω ≼ 𝐴 → 𝐴 ∈ V)
94	93	3ad2ant1 1150	. . . 4 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → 𝐴 ∈ V)
95		map0e 8878	. . . 4 ⊢ (𝐴 ∈ V → (𝐴 ↑m ∅) = 1o)
96	94, 95	syl 18	. . 3 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → (𝐴 ↑m ∅) = 1o)
97		1oex 8461	. . . . 5 ⊢ 1o ∈ V
98	97	enref 8980	. . . 4 ⊢ 1o ≈ 1o
99		df-sn 4589	. . . . 5 ⊢ {∅} = {𝑥 ∣ 𝑥 = ∅}
100		df1o2 8458	. . . . 5 ⊢ 1o = {∅}
101		en0 9013	. . . . . . . 8 ⊢ (𝑥 ≈ ∅ ↔ 𝑥 = ∅)
102	101	anbi2i 634	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅) ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 = ∅))
103		0ss 4356	. . . . . . . . 9 ⊢ ∅ ⊆ 𝐴
104		sseq1 3961	. . . . . . . . 9 ⊢ (𝑥 = ∅ → (𝑥 ⊆ 𝐴 ↔ ∅ ⊆ 𝐴))
105	103, 104	mpbiri 261	. . . . . . . 8 ⊢ (𝑥 = ∅ → 𝑥 ⊆ 𝐴)
106	105	pm4.71ri 569	. . . . . . 7 ⊢ (𝑥 = ∅ ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 = ∅))
107	102, 106	bitr4i 281	. . . . . 6 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅) ↔ 𝑥 = ∅)
108	107	abbii 2829	. . . . 5 ⊢ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)} = {𝑥 ∣ 𝑥 = ∅}
109	99, 100, 108	3eqtr4ri 2796	. . . 4 ⊢ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)} = 1o
110	98, 109	breqtrri 5137	. . 3 ⊢ 1o ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)}
111	96, 110	eqbrtrdi 5149	. 2 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → (𝐴 ↑m ∅) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)})
112	5, 92, 111	pm2.61ne 3042	1 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → (𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1102   = wceq 1569  ∃wex 1808   ∈ wcel 2142  {cab 2740   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  Vcvv 3454   ⊆ wss 3904  ∅c0 4285  {csn 4588   class class class wbr 5108   ↦ cmpt 5191   × cxp 5658  dom cdm 5660  ran crn 5661  Fun wfun 6530   Fn wfn 6531  ⟶wf 6532  –onto→wfo 6534  –1-1-onto→wf1o 6535  (class class class)co 7412  ωcom 7860  1_oc1o 8444   ↑_m cmap 8822   ≈ cen 8938   ≼ cdom 8939  cardccrd 9928

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-inf2 9608

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  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 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-se 5614  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-1o 8451  df-er 8692  df-map 8824  df-en 8942  df-dom 8943  df-sdom 8944  df-fin 8945  df-oi 9470  df-card 9932  df-acn 9935

This theorem is used by:  infmap  10567