Theorem infmap2 9642

Description: An exponentiation law for infinite cardinals. Similar to Lemma 6.2 of [Jech] p. 43. Although this version of infmap 10000 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 7166	. . 3 ⊢ (𝐵 = ∅ → (𝐴 ↑m 𝐵) = (𝐴 ↑m ∅))
2		breq2 5072	. . . . 5 ⊢ (𝐵 = ∅ → (𝑥 ≈ 𝐵 ↔ 𝑥 ≈ ∅))
3	2	anbi2d 630	. . . 4 ⊢ (𝐵 = ∅ → ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵) ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)))
4	3	abbidv 2887	. . 3 ⊢ (𝐵 = ∅ → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)})
5	1, 4	breq12d 5081	. 2 ⊢ (𝐵 = ∅ → ((𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ↔ (𝐴 ↑m ∅) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)}))
6		simpl2 1188	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐵 ≼ 𝐴)
7		reldom 8517	. . . . . . . . . . 11 ⊢ Rel ≼
8	7	brrelex1i 5610	. . . . . . . . . 10 ⊢ (𝐵 ≼ 𝐴 → 𝐵 ∈ V)
9	6, 8	syl 17	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐵 ∈ V)
10	7	brrelex2i 5611	. . . . . . . . . 10 ⊢ (𝐵 ≼ 𝐴 → 𝐴 ∈ V)
11	6, 10	syl 17	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐴 ∈ V)
12		xpcomeng 8611	. . . . . . . . 9 ⊢ ((𝐵 ∈ V ∧ 𝐴 ∈ V) → (𝐵 × 𝐴) ≈ (𝐴 × 𝐵))
13	9, 11, 12	syl2anc 586	. . . . . . . 8 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐵 × 𝐴) ≈ (𝐴 × 𝐵))
14		simpl3 1189	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 ↑m 𝐵) ∈ dom card)
15		simpr 487	. . . . . . . . . . 11 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐵 ≠ ∅)
16		mapdom3 8691	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵))
17	11, 9, 15, 16	syl3anc 1367	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵))
18		numdom 9466	. . . . . . . . . 10 ⊢ (((𝐴 ↑m 𝐵) ∈ dom card ∧ 𝐴 ≼ (𝐴 ↑m 𝐵)) → 𝐴 ∈ dom card)
19	14, 17, 18	syl2anc 586	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → 𝐴 ∈ dom card)
20		simpl1 1187	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → ω ≼ 𝐴)
21		infxpabs 9636	. . . . . . . . 9 ⊢ (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ≠ ∅ ∧ 𝐵 ≼ 𝐴)) → (𝐴 × 𝐵) ≈ 𝐴)
22	19, 20, 15, 6, 21	syl22anc 836	. . . . . . . 8 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 × 𝐵) ≈ 𝐴)
23		entr 8563	. . . . . . . 8 ⊢ (((𝐵 × 𝐴) ≈ (𝐴 × 𝐵) ∧ (𝐴 × 𝐵) ≈ 𝐴) → (𝐵 × 𝐴) ≈ 𝐴)
24	13, 22, 23	syl2anc 586	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐵 × 𝐴) ≈ 𝐴)
25		ssenen 8693	. . . . . . 7 ⊢ ((𝐵 × 𝐴) ≈ 𝐴 → {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
26	24, 25	syl 17	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
27		relen 8516	. . . . . . 7 ⊢ Rel ≈
28	27	brrelex1i 5610	. . . . . 6 ⊢ ({𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} → {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ∈ V)
29	26, 28	syl 17	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ∈ V)
30		abid2 2959	. . . . . 6 ⊢ {𝑥 ∣ 𝑥 ∈ (𝐴 ↑m 𝐵)} = (𝐴 ↑m 𝐵)
31		elmapi 8430	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ↑m 𝐵) → 𝑥:𝐵⟶𝐴)
32		fssxp 6536	. . . . . . . . 9 ⊢ (𝑥:𝐵⟶𝐴 → 𝑥 ⊆ (𝐵 × 𝐴))
33		ffun 6519	. . . . . . . . . . 11 ⊢ (𝑥:𝐵⟶𝐴 → Fun 𝑥)
34		vex 3499	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
35	34	fundmen 8585	. . . . . . . . . . 11 ⊢ (Fun 𝑥 → dom 𝑥 ≈ 𝑥)
36		ensym 8560	. . . . . . . . . . 11 ⊢ (dom 𝑥 ≈ 𝑥 → 𝑥 ≈ dom 𝑥)
37	33, 35, 36	3syl 18	. . . . . . . . . 10 ⊢ (𝑥:𝐵⟶𝐴 → 𝑥 ≈ dom 𝑥)
38		fdm 6524	. . . . . . . . . 10 ⊢ (𝑥:𝐵⟶𝐴 → dom 𝑥 = 𝐵)
39	37, 38	breqtrd 5094	. . . . . . . . 9 ⊢ (𝑥:𝐵⟶𝐴 → 𝑥 ≈ 𝐵)
40	32, 39	jca 514	. . . . . . . 8 ⊢ (𝑥:𝐵⟶𝐴 → (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵))
41	31, 40	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ↑m 𝐵) → (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵))
42	41	ss2abi 4045	. . . . . 6 ⊢ {𝑥 ∣ 𝑥 ∈ (𝐴 ↑m 𝐵)} ⊆ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)}
43	30, 42	eqsstrri 4004	. . . . 5 ⊢ (𝐴 ↑m 𝐵) ⊆ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)}
44		ssdomg 8557	. . . . 5 ⊢ ({𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ∈ V → ((𝐴 ↑m 𝐵) ⊆ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} → (𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)}))
45	29, 43, 44	mpisyl 21	. . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)})
46		domentr 8570	. . . 4 ⊢ (((𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ∧ {𝑥 ∣ (𝑥 ⊆ (𝐵 × 𝐴) ∧ 𝑥 ≈ 𝐵)} ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)}) → (𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
47	45, 26, 46	syl2anc 586	. . 3 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
48		ovex 7191	. . . . . . 7 ⊢ (𝐴 ↑m 𝐵) ∈ V
49	48	mptex 6988	. . . . . 6 ⊢ (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ∈ V
50	49	rnex 7619	. . . . 5 ⊢ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ∈ V
51		ensym 8560	. . . . . . . . . . . 12 ⊢ (𝑥 ≈ 𝐵 → 𝐵 ≈ 𝑥)
52	51	ad2antll 727	. . . . . . . . . . 11 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → 𝐵 ≈ 𝑥)
53		bren 8520	. . . . . . . . . . 11 ⊢ (𝐵 ≈ 𝑥 ↔ ∃𝑓 𝑓:𝐵–1-1-onto→𝑥)
54	52, 53	sylib 220	. . . . . . . . . 10 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → ∃𝑓 𝑓:𝐵–1-1-onto→𝑥)
55		f1of 6617	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:𝐵–1-1-onto→𝑥 → 𝑓:𝐵⟶𝑥)
56	55	adantl 484	. . . . . . . . . . . . . . 15 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑓:𝐵⟶𝑥)
57		simplrl 775	. . . . . . . . . . . . . . 15 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑥 ⊆ 𝐴)
58	56, 57	fssd 6530	. . . . . . . . . . . . . 14 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑓:𝐵⟶𝐴)
59	11, 9	elmapd 8422	. . . . . . . . . . . . . . 15 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝑓 ∈ (𝐴 ↑m 𝐵) ↔ 𝑓:𝐵⟶𝐴))
60	59	ad2antrr 724	. . . . . . . . . . . . . 14 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → (𝑓 ∈ (𝐴 ↑m 𝐵) ↔ 𝑓:𝐵⟶𝐴))
61	58, 60	mpbird 259	. . . . . . . . . . . . 13 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑓 ∈ (𝐴 ↑m 𝐵))
62		f1ofo 6624	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:𝐵–1-1-onto→𝑥 → 𝑓:𝐵–onto→𝑥)
63		forn 6595	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:𝐵–onto→𝑥 → ran 𝑓 = 𝑥)
64	62, 63	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐵–1-1-onto→𝑥 → ran 𝑓 = 𝑥)
65	64	adantl 484	. . . . . . . . . . . . . 14 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → ran 𝑓 = 𝑥)
66	65	eqcomd 2829	. . . . . . . . . . . . 13 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → 𝑥 = ran 𝑓)
67	61, 66	jca 514	. . . . . . . . . . . 12 ⊢ (((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) ∧ 𝑓:𝐵–1-1-onto→𝑥) → (𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓))
68	67	ex 415	. . . . . . . . . . 11 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → (𝑓:𝐵–1-1-onto→𝑥 → (𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓)))
69	68	eximdv 1918	. . . . . . . . . 10 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → (∃𝑓 𝑓:𝐵–1-1-onto→𝑥 → ∃𝑓(𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓)))
70	54, 69	mpd 15	. . . . . . . . 9 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → ∃𝑓(𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓))
71		df-rex 3146	. . . . . . . . 9 ⊢ (∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓 ↔ ∃𝑓(𝑓 ∈ (𝐴 ↑m 𝐵) ∧ 𝑥 = ran 𝑓))
72	70, 71	sylibr 236	. . . . . . . 8 ⊢ ((((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)) → ∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓)
73	72	ex 415	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵) → ∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓))
74	73	ss2abdv 4046	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ⊆ {𝑥 ∣ ∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓})
75		eqid 2823	. . . . . . 7 ⊢ (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) = (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓)
76	75	rnmpt 5829	. . . . . 6 ⊢ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) = {𝑥 ∣ ∃𝑓 ∈ (𝐴 ↑m 𝐵)𝑥 = ran 𝑓}
77	74, 76	sseqtrrdi 4020	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ⊆ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓))
78		ssdomg 8557	. . . . 5 ⊢ (ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ∈ V → ({𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ⊆ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓)))
79	50, 77, 78	mpsyl 68	. . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓))
80		vex 3499	. . . . . . . . 9 ⊢ 𝑓 ∈ V
81	80	rnex 7619	. . . . . . . 8 ⊢ ran 𝑓 ∈ V
82	81	rgenw 3152	. . . . . . 7 ⊢ ∀𝑓 ∈ (𝐴 ↑m 𝐵)ran 𝑓 ∈ V
83	75	fnmpt 6490	. . . . . . 7 ⊢ (∀𝑓 ∈ (𝐴 ↑m 𝐵)ran 𝑓 ∈ V → (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) Fn (𝐴 ↑m 𝐵))
84	82, 83	mp1i 13	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) Fn (𝐴 ↑m 𝐵))
85		dffn4 6598	. . . . . 6 ⊢ ((𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) Fn (𝐴 ↑m 𝐵) ↔ (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓):(𝐴 ↑m 𝐵)–onto→ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓))
86	84, 85	sylib 220	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓):(𝐴 ↑m 𝐵)–onto→ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓))
87		fodomnum 9485	. . . . 5 ⊢ ((𝐴 ↑m 𝐵) ∈ dom card → ((𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓):(𝐴 ↑m 𝐵)–onto→ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) → ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ≼ (𝐴 ↑m 𝐵)))
88	14, 86, 87	sylc 65	. . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ≼ (𝐴 ↑m 𝐵))
89		domtr 8564	. . . 4 ⊢ (({𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ∧ ran (𝑓 ∈ (𝐴 ↑m 𝐵) ↦ ran 𝑓) ≼ (𝐴 ↑m 𝐵)) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ (𝐴 ↑m 𝐵))
90	79, 88, 89	syl2anc 586	. . 3 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ (𝐴 ↑m 𝐵))
91		sbth 8639	. . 3 ⊢ (((𝐴 ↑m 𝐵) ≼ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ∧ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)} ≼ (𝐴 ↑m 𝐵)) → (𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
92	47, 90, 91	syl2anc 586	. 2 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) ∧ 𝐵 ≠ ∅) → (𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})
93	7	brrelex2i 5611	. . . . 5 ⊢ (ω ≼ 𝐴 → 𝐴 ∈ V)
94	93	3ad2ant1 1129	. . . 4 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → 𝐴 ∈ V)
95		map0e 8448	. . . 4 ⊢ (𝐴 ∈ V → (𝐴 ↑m ∅) = 1o)
96	94, 95	syl 17	. . 3 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → (𝐴 ↑m ∅) = 1o)
97		1oex 8112	. . . . 5 ⊢ 1o ∈ V
98	97	enref 8544	. . . 4 ⊢ 1o ≈ 1o
99		df-sn 4570	. . . . 5 ⊢ {∅} = {𝑥 ∣ 𝑥 = ∅}
100		df1o2 8118	. . . . 5 ⊢ 1o = {∅}
101		en0 8574	. . . . . . . 8 ⊢ (𝑥 ≈ ∅ ↔ 𝑥 = ∅)
102	101	anbi2i 624	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅) ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 = ∅))
103		0ss 4352	. . . . . . . . 9 ⊢ ∅ ⊆ 𝐴
104		sseq1 3994	. . . . . . . . 9 ⊢ (𝑥 = ∅ → (𝑥 ⊆ 𝐴 ↔ ∅ ⊆ 𝐴))
105	103, 104	mpbiri 260	. . . . . . . 8 ⊢ (𝑥 = ∅ → 𝑥 ⊆ 𝐴)
106	105	pm4.71ri 563	. . . . . . 7 ⊢ (𝑥 = ∅ ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 = ∅))
107	102, 106	bitr4i 280	. . . . . 6 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅) ↔ 𝑥 = ∅)
108	107	abbii 2888	. . . . 5 ⊢ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)} = {𝑥 ∣ 𝑥 = ∅}
109	99, 100, 108	3eqtr4ri 2857	. . . 4 ⊢ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)} = 1o
110	98, 109	breqtrri 5095	. . 3 ⊢ 1o ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)}
111	96, 110	eqbrtrdi 5107	. 2 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → (𝐴 ↑m ∅) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ ∅)})
112	5, 92, 111	pm2.61ne 3104	1 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ≼ 𝐴 ∧ (𝐴 ↑m 𝐵) ∈ dom card) → (𝐴 ↑m 𝐵) ≈ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝐵)})

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537  ∃wex 1780   ∈ wcel 2114  {cab 2801   ≠ wne 3018  ∀wral 3140  ∃wrex 3141  Vcvv 3496   ⊆ wss 3938  ∅c0 4293  {csn 4569   class class class wbr 5068   ↦ cmpt 5148   × cxp 5555  dom cdm 5557  ran crn 5558  Fun wfun 6351   Fn wfn 6352  ⟶wf 6353  –onto→wfo 6355  –1-1-onto→wf1o 6356  (class class class)co 7158  ωcom 7582  1_oc1o 8097   ↑_m cmap 8408   ≈ cen 8508   ≼ cdom 8509  cardccrd 9366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-inf2 9106

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-isom 6366  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-er 8291  df-map 8410  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-oi 8976  df-card 9370  df-acn 9373

This theorem is referenced by:  infmap  10000